Related papers: Deflated GMRES for Systems with Multiple Shifts an…
Global and block Krylov subspace methods are efficient iterative solvers for large sparse linear systems with multiple right-hand sides. However, global or block Lanczos-type solvers often exhibit large oscillations in the residual norms…
In this paper the author introduces a new domain decomposition method for the solution of discretised integral equation eigenvalue problems. The new domain decomposition method is motivated by the so-called automated multi-level…
Linear systems in applications are typically well-posed, and yet the coefficient matrices may be nearly singular in that the condition number $\kappa(\boldsymbol{A})$ may be close to $1/\varepsilon_{w}$, where $\varepsilon_{w}$ denotes the…
Fully realizing the potential of multigrid solvers often requires custom algorithms for a given application model, discretizations and even regimes of interest, despite considerable effort from the applied math community to develop fully…
This work focuses on the development of a self adjusting multirate strategy based on an implicit time discretization for the numerical solution of hyperbolic equations, that could benefit from different time steps in different areas of the…
We introduce a class of efficient multiple right-hand side multigrid algorithm for domain wall fermions. The simultaneous solution for a modest number of right hand sides concurrently allows for a significant reduction in the time spent…
In earlier work we have studied a method for discretization in time of a parabolic problem which consists in representing the exact solution as an integral in the complex plane and then applying a quadrature formula to this integral. In…
This work deals with the efficient numerical solution of the time-fractional heat equation discretized on non-uniform temporal meshes. Non-uniform grids are essential to capture the singularities of "typical" solutions of time-fractional…
We present a new method for the numerical solution of singular integral equations on the real axis. The method's value stems from an explicit formula for the Cauchy integral of a complex exponential multiplied by a rational function.…
Electro-quasistatic field problems involving nonlinear materials are commonly discretized in space using finite elements. In this paper, it is proposed to solve the resulting system of ordinary differential equations by an explicit…
A biorthonormal-block density-matrix renormalization group algorithm is proposed to accurately compute properties of large-scale non-Hermitian many-body systems, in which a renormalized-space partition of the non-Hermitian reduced density…
We develop an accelerated gradient descent algorithm on the Grassmann manifold to compute the subspace spanned by a number of leading eigenvectors of a symmetric positive semi-definite matrix. This has a constant cost per iteration and a…
Density Matrix Renormalization Group (DMRG) algorithm has been extremely successful for computing the ground states of one-dimensional quantum many-body systems. For problems concerned with mixed quantum states, however, it is less…
We have extended the density matrix renormalization group (DMRG) approach to two-fluid open many-fermion systems governed by complex-symmetric Hamiltonians. The applications are carried out for three- and four-nucleon (proton-neutron)…
The Density Matrix Renormalization Group (DMRG) has become a powerful numerical method that can be applied to low-dimensional strongly correlated fermionic and bosonic systems. It allows for a very precise calculation of static, dynamical…
Solving symmetric positive definite linear problems is a fundamental computational task in machine learning. The exact solution, famously, is cubicly expensive in the size of the matrix. To alleviate this problem, several linear-time…
The use of block Krylov subspace methods for computing the solution to a sequence of shifted linear systems using subspace recycling was first proposed in [Soodhalter, SISC 2016], where a recycled shifted block GMRES algorithm (rsbGMRES)…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
In this paper, a full (nested) multigrid scheme is proposed to solve eigenvalue problems. The idea here is to use the multilevel correction method to transform the solution of eigenvalue problem to a series of solutions of the corresponding…
Multiresolution Matrix Factorization (MMF) was recently introduced as an alternative to the dominant low-rank paradigm in order to capture structure in matrices at multiple different scales. Using ideas from multiresolution analysis (MRA),…