2014
DOI: 10.1145/2527267
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm 937

Abstract: We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-definite pre-conditioner may be supplied. Our FORTRAN 90 implementation illustrates a design pattern that allows users… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…The weak point of this type of penumbra function is the discrete nature in describing the penumbra curve. On the contrary, the LSRE is based on an inverse square root function [12, 13] and is a continuous equation that can fit the entire dose profile along the x axis (Figure 9).…”
Section: Discussionmentioning
confidence: 99%
“…The weak point of this type of penumbra function is the discrete nature in describing the penumbra curve. On the contrary, the LSRE is based on an inverse square root function [12, 13] and is a continuous equation that can fit the entire dose profile along the x axis (Figure 9).…”
Section: Discussionmentioning
confidence: 99%
“…We initialize the RBM with a set of random parameters W, generally using α = 4, and search for the ground state of the Hamiltonian (2) by minimizing the energy expectation value of the RBM state (1) using the stochastic reconfiguration (SR) method to update the RBM wavefunction [1,26,27,29,42]. In Table I, we compare the results we obtain from exact diagonalization (ED) to those from the RBM ansatz for various system sizes.…”
Section: Restricted Boltzmann Machine Statesmentioning
confidence: 99%
“…for dw. We adopt the MINRES-QLP algorithm [42], which is an iterative linear solver based on the Lanczos method. Lanczos tridiagonalization requires the calculation of the Krylov space which involves matrix-vector multiplications of the form S w v, where v is a generic vector with 2N w entries.…”
Section: A2 Efficient Calculation Of Step In Parameter Spacementioning
confidence: 99%
“…The MINRES method is then a special variant of GMRES, which makes use of the tridiagonal structure. The table below, adopted from [3], gives a comparison of computational complexities of MINRES and GMRES without preconditioning for solution of a linear system Ax = b with a symmetric m × m matrix A in terms of memory storage required by working vectors in the solvers and the number of floating-point operations. By t P we denote the work needed for evaluating a i (V ).…”
Section: Algorithm 1 Preconditioned Gmres Without Restartsmentioning
confidence: 99%
“…MINRES requires symmetric positive definite preconditioners such as in [12]. In our MINRES simulations, although not reported in Section 5 in details, we use the preconditioned MINRES-QLP method from [3].…”
Section: Storagementioning
confidence: 99%