Related papers: Space-time least squares approximation for Schr\"o…
We propose an isogeometric solver for Poisson problems that combines i)low-rank tensor techniques to approximate the unknown solution and the system matrix, as a sum of a few terms having Kronecker product structure, ii) a Truncated…
In this paper, a fast solver is studied for saddle point system arising from a second-order Crank-Nicolson discretization of an initial-valued parabolic PDE constrained optimal control problem, which is indefinite and ill-conditioned.…
Domain decomposition methods are among the most efficient for solving sparse linear systems of equations. Their effectiveness relies on a judiciously chosen coarse space. Originally introduced and theoretically proved to be efficient for…
Accelerating iterative eigenvalue algorithms is often achieved by employing a spectral shifting strategy. Unfortunately, improved shifting typically leads to a smaller eigenvalue for the resulting shifted operator, which in turn results in…
Randomized methods are becoming increasingly popular in numerical linear algebra. However, few attempts have been made to use them in developing preconditioners. Our interest lies in solving large-scale sparse symmetric positive definite…
In this paper we study the application of the Sobolev gradients technique to the problem of minimizing several Schr\"odinger functionals related to timely and difficult nonlinear problems in Quantum Mechanics and Nonlinear Optics. We show…
The Lippmann-Schwinger equation is an integral equation formulation for acoustic and electromagnetic scattering from an inhomogeneous media and quantum scattering from a localized potential. We present the sparsifying preconditioner for…
The goal of this paper is to propose preconditioners for the system of linear equations that arises from a discretization of fourth order elliptic problems using spectral element methods. These preconditioners are constructed using…
In this paper we propose a new class of preconditioners for the isogeometric discretization of the Stokes system. Their application involves the solution of a Sylvester-like equation, which can be done efficiently thanks to the Fast…
We derive optimal order a posteriori error estimates for fully discrete approximations of linear Schr\"odinger-type equations, in the $L^\infty(L^2)-$norm. For the discretization in time we use the Crank-Nicolson method, while for the space…
In this article, we derive a new, fast, and robust preconditioned iterative solution strategy for the all-at-once solution of optimal control problems with time-dependent PDEs as constraints, including the heat equation and the non-steady…
In this article we design and analyze a class of two-level non-overlapping additive Schwarz preconditioners for the solution of the linear system of equations stemming from discontinuous Galerkin discretizations of second-order elliptic…
In this paper, we apply the Schwarz Waveform Relaxation (SWR) method to the one dimensional Schr{\"o}dinger equation with a general linear or a nonlinear potential. We propose a new algorithm for the Schr{\"o}dinger equation with time…
In this paper, we develop a fast numerical method for solving the time-dependent Riesz space fractional diffusion equations with a nonlinear source term in the convex domain. An implicit finite difference method is employed to discretize…
The aim of this paper is to develop new optimized Schwarz algorithms for the one dimensional Schr{\"o}dinger equation with linear or nonlinear potential. After presenting the classical algorithm which is an iterative process, we propose a…
This paper presents fast solvers for linear systems arising from the discretization of fractional nonlinear Schr\"odinger equations with Riesz derivatives and attractive nonlinearities. These systems are characterized by complex symmetry,…
A preconditioning strategy is proposed for the iterative solve of large numbers of linear systems with parameter-dependent matrix and right-hand side which arise during the computation of solution statistics of stochastic elliptic partial…
The discretization of certain integral equations, e.g., the first-kind Fredholm equation of Laplace's equation, leads to symmetric positive-definite linear systems, where the coefficient matrix is dense and often ill-conditioned. We…
This paper provides the first provable $\mathcal{O}(N \log N)$ algorithms for the linear system arising from the direct finite element discretization of the fourth-order equation with different boundary conditions on unstructured grids of…
We consider large linear systems arising from the isogeometric discretization of the Poisson problem on a single-patch domain. The numerical solution of such systems is considered a challenging task, particularly when the degree of the…