Related papers: On preconditioning and solving an extended class o…
A linearly implicit conservative difference scheme is applied to discretize the attractive coupled nonlinear Schr\"odinger equations with fractional Laplacian. Complex symmetric linear systems can be obtained, and the system matrices are…
We present an enhanced version of the row-based randomized block-Kaczmarz method to solve a linear system of equations. This improvement makes use of a regularization during block updates in the solution, and a dynamic proposal distribution…
We consider a mixed dimensional elliptic partial differential equation posed in a bulk domain with a large number of embedded interfaces. In particular, we study well-posedness of the problem and regularity of the solution. We also propose…
This report shows on real data that the direct methods such as LDL decomposition and Gaussian elimination for solving linear systems with ill-conditioned matrices provide inaccurate results due to divisions by very small numbers, which in…
This paper deals with the fast solution of linear systems associated with the mass matrix, in the context of isogeometric analysis. We propose a preconditioner that is both efficient and easy to implement, based on a diagonal-scaled…
In this study, we propose the lopsided HSS (LHSS) iteration method for solving a class of complex symmetric indefinite systems of linear equations. This method employs an alternating iterative scheme, where each iteration entails solving…
Iterative solvers for large-scale linear systems such as Krylov subspace methods can diverge when the linear system is ill-conditioned, thus significantly reducing the applicability of these iterative methods in practice for…
This paper explores preconditioning the normal equation for non-symmetric square linear systems arising from PDE discretization, focusing on methods like CGNE and LSQR. The concept of ``normal'' preconditioning is introduced and a strategy…
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic…
This paper introduces the localized sparsifying preconditioner for the pseudospectral approximations of indefinite systems on periodic structures. The work is built on top of the recently proposed sparsifying preconditioner with two major…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
Preconditioning is a technique from numerical linear algebra that can accelerate algorithms to solve systems of equations. In this paper, we demonstrate how preconditioning can circumvent a stringent assumption for sign consistency in…
In this paper, the concept of matrix splitting is introduced to solve a large sparse ill-posed linear system via Tikhonov's regularization. In the regularization process, we convert the ill-posed system to a well-posed system. The…
The discretization of the double-layer potential integral equation for the interior Dirichlet Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations…
Several preconditioned AOR methods have been proposed to solve system of linear equations $Ax=b$, where $A \in \mathbb{R}^{n \times n}$ is a unit Z-matrix. The aim of this paper is to give a comparison result for a class of preconditioners…
In this paper, we discuss a novel model reduction framework for generalized linear systems. The transfer functions of these systems are assumed to have a special structure, e.g., coming from second-order linear systems and time-delay…
We present a rational filter for computing all eigenvalues of a symmetric definite eigenvalue problem lying in an interval on the real axis. The linear systems arising from the filter embedded in the subspace iteration framework, are solved…
We propose a preconditioner to accelerate the convergence of the GMRES iterative method for solving the system of linear equations obtained from discretize-then-optimize approach applied to optimal control problems constrained by a partial…
The work is devoted to the development of numerical methods for computing "formal solutions" of interval systems of linear algebraic equations. These solutions are found in Kaucher interval arithmetic, which extends and completes the…
We introduce a new class of hybrid preconditioners for solving parametric linear systems of equations. The proposed preconditioners are constructed by hybridizing the deep operator network, namely DeepONet, with standard iterative methods.…