Related papers: Sine-transform-based fast solvers for Riesz fracti…
We establish the existence of infinitely many nonnegative, segregated solutions for the sublinearly coupled Schr\"odinger system \begin{equation*} \left\{\begin{aligned}-\Delta u+K_1(x)u&=\mu u^{p-1}+ (\sigma_1+1)\beta…
The finite cell method is a highly flexible discretization technique for numerical analysis on domains with complex geometries. By using a non-boundary conforming computational domain that can be easily meshed, automatized computations on a…
We propose an explicit, oracle-free quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work to incorporate (a) Robin boundary conditions - which include Neumann and…
We consider linear systems arising from the use of the finite element method for solving scalar linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by…
We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…
A domain decomposition method for the solution of general variable-coefficient elliptic partial differential equations on regular domains is introduced. The method is based on tessellating the domain into overlapping thin slabs or shells,…
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…
We derive parameter-robust quasi-optimal error estimates for mixed finite element methods for the nonlinear Darcy--Forchheimer equations with mixed boundary conditions. Using the framework of operator preconditioning, we also design…
In this paper, we apply the optimized Schwarz method to the two dimensional nonlinear Schr{\"o}dinger equation and extend this method to the simulation of Bose-Einstein condensates (Gross-Pitaevskii equation). We propose an extended version…
We propose several circulant preconditioners for systems defined by some functions $g$ of Toeplitz matrices $A_n$. In this paper we are interested in solving $g(A_n)\mathbf{x}=\mathbf{b}$ by the preconditioned conjugate method or the…
We study the solution of block-structured linear algebra systems arising in optimization by using iterative solution techniques. These systems are the core computational bottleneck of many problems of interest such as parameter estimation,…
We propose an augmented Lagrangian-based preconditioner to accelerate the convergence of Krylov subspace methods applied to linear systems of equations with a block three-by-three structure such as those arising from mixed finite element…
This paper detailedly discusses the locally one-dimensional numerical methods for efficiently solving the three-dimensional fractional partial differential equations, including fractional advection diffusion equation and Riesz fractional…
There has been a growing interest in parallel strategies for solving trajectory optimization problems. One key step in many algorithmic approaches to trajectory optimization is the solution of moderately-large and sparse linear systems.…
We present a fast direct solver for structured linear systems based on multilevel matrix compression. Using the recently developed interpolative decomposition of a low-rank matrix in a recursive manner, we embed an approximation of the…
In this paper, we develop fast procedures for solving linear systems arising from discretization of ordinary and partial differential equations with Caputo fractional derivative w.r.t time variable. First, we consider a finite difference…
Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in…
We revisit gradient-based optimization for infinite projected entangled pair states (iPEPS), a tensor network ansatz for simulating many-body quantum systems. This approach is hindered by two major challenges: the high computational cost of…
We present a preconditioner for saddle point problems. The proposed preconditioner is extracted from a stationary iterative method which is convergent under a mild condition. Some properties of the preconditioner as well as the eigenvalues…
The authors propose a recycling Krylov subspace method for the solution of a sequence of self-adjoint linear systems. Such problems appear, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically…