On variational iterative methods for semilinear problems

08/01/2019
by   Prosper Torsu, et al.
0

This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into linear systems which are solvable using fast Poisson solvers. Theoretical justifications are provided and supported by several experiments. Numerical results show that the method is not only computationally less expensive, but also yields accurate approximations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2021

Arbitrarily high-order methods for Poisson problems

In this paper we are concerned with energy-conserving methods for Poisso...
research
06/06/2023

Kernel Quadrature with Randomly Pivoted Cholesky

This paper presents new quadrature rules for functions in a reproducing ...
research
10/26/2020

Learning Fast Approximations of Sparse Nonlinear Regression

The idea of unfolding iterative algorithms as deep neural networks has b...
research
11/25/2022

On Krylov Methods for Large Scale CBCT Reconstruction

Krylov subspace methods are a powerful family of iterative solvers for l...
research
10/31/2022

On the Geometry Transferability of the Hybrid Iterative Numerical Solver for Differential Equations

The discovery of fast numerical solvers prompted a clear and rapid shift...
research
12/07/2021

Posterior linearisation smoothing with robust iterations

This paper considers the problem of robust iterative Bayesian smoothing ...

Please sign up or login with your details

Forgot password? Click here to reset