Related papers: ILU Preconditioning Based on the FAPINV Algorithm
The solution of linear inverse problems when the unknown parameters outnumber data requires addressing the problem of a nontrivial null space. After restating the problem within the Bayesian framework, a priori information about the unknown…
The Electric Field Integral Equation (EFIE) is notorious for its ill-conditioning both in frequency and h-refinement. Several techniques exist for fixing the equation conditioning problems based on hierarchical strategies, Calderon…
We present a block lower triangular (BLT) preconditioner to accelerate the convergence of nthe Krylov subspace iterative methods, such as generalized minimal residual (GMRES), for solving a broad class of complex symmetric system of linear…
LU-Net is a simple and fast architecture for invertible neural networks (INN) that is based on the factorization of quadratic weight matrices $\mathsf{A=LU}$, where $\mathsf{L}$ is a lower triangular matrix with ones on the diagonal and…
This work is on a user-friendly reduced basis method for solving a family of parametric PDEs by preconditioned Krylov subspace methods including the conjugate gradient method, generalized minimum residual method, and bi-conjugate gradient…
We present a sparse matrix permutation from graph theory that gives stable incomplete Lower-Upper (LU) preconditioners necessary for iterative solutions to the steady state density matrix for quantum optomechanical systems. This reordering…
We develop a robust and efficient iterative method for hyper-elastodynamics based on a novel continuum formulation recently developed. The numerical scheme is constructed based on the variational multiscale formulation and the…
We consider the problem of approximating the von Neumann entropy of a large, sparse, symmetric positive semidefinite matrix $A$, defined as $\operatorname{tr}(f(A))$ where $f(x)=-x\log x$. After establishing some useful properties of this…
Integer linear programming (ILP) models a wide range of practical combinatorial optimization problems and significantly impacts industry and management sectors. This work proposes new characterizations of ILP with the concept of boundary…
Context. Numerical solutions to transfer problems of polarized radiation in solar and stellar atmospheres commonly rely on stationary iterative methods, which often perform poorly when applied to large problems. In recent times, stationary…
Recent work has shown logical background knowledge can be used in learning systems to compensate for a lack of labeled training data. Many methods work by creating a loss function that encodes this knowledge. However, often the logic is…
In this paper, we design preconditioners for the matrix-free solution of high-order continuous and discontinuous Galerkin discretizations of elliptic problems based on FEM-SEM equivalence and additive Schwarz methods. The high-order…
With the commercial availability of mixed precision hardware, mixed precision GMRES-based iterative refinement schemes have emerged as popular approaches for solving sparse linear systems. Existing analyses of these approaches, however, are…
This survey explores modern approaches for computing low-rank approximations of high-dimensional matrices by means of the randomized SVD, randomized subspace iteration, and randomized block Krylov iteration. The paper compares the…
Fully implicit Runge-Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty…
We consider the problem of approximating the solution to $A(\mu) x(\mu) = b$ for many different values of the parameter $\mu$. Here we assume $A(\mu)$ is large, sparse, and nonsingular with a nonlinear dependence on $\mu$. Our method is…
As integrated circuits become increasingly complex, the demand for efficient and accurate simulation solvers continues to rise. Traditional solvers often struggle with large-scale sparse systems, leading to prolonged simulation times and…
Gaussian processes are flexible probabilistic regression models which are widely used in statistics and machine learning. However, a drawback is their limited scalability to large data sets. To alleviate this, full-scale approximations…
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…
This work considers the convergence of GMRES for non-singular problems. GMRES is interpreted as the GCR method which allows for simple proofs of the convergence estimates. Preconditioning and weighted norms within GMRES are considered. The…