Results 131 to 140 of about 733 (176)
3D-Printed Closed-Channel Spiral Inertial Microfluidic Device for Size-Based Particle Separation. [PDF]
Ozyilmaz E, Gediz Ilis G.
europepmc +1 more source
Improving EEG Forward Modeling Using High-Resolution Five-Layer BEM-FMM Head Models: Effect on Source Reconstruction Accuracy. [PDF]
Nuñez Ponasso G +10 more
europepmc +1 more source
A Plug-and-Play Volume Minimizing Micromixer. [PDF]
Kolesnik K +3 more
europepmc +1 more source
Achieving high precision in analog in-memory computing systems. [PDF]
Mannocci P +3 more
europepmc +1 more source
Thermodynamically Consistent Enthalpies of Adsorption of Mixtures from Classical Density Functional Theory. [PDF]
Rehner P.
europepmc +1 more source
Data-driven, ML-assisted approaches to problem well-posedness. [PDF]
Bertalan T +5 more
europepmc +1 more source
Weighted Inner Products for GMRES and GMRES-DR [PDF]
Revision containing edits to the text, corrections, and removal of the section on Arnoldi in weighted inner products (to reduce the manuscript's length)
Ronald Morgan, Mark Embree
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Matrix Analysis and Applications, 1997
The GMRES algorithm for solving non-Hermitian linear systems \(Ax=b\) \((A\in\mathbb{C}^{N\times N}\), \(b\in \mathbb{C}^{N}\) is studied. The ideal GMRES problem is obtained if one consideres minimization of \(|p(A) |\) instead of \(|p(A)b|\) as in the GMRES algorithm.
Kim-Chuan Toh
exaly +2 more sources
The GMRES algorithm for solving non-Hermitian linear systems \(Ax=b\) \((A\in\mathbb{C}^{N\times N}\), \(b\in \mathbb{C}^{N}\) is studied. The ideal GMRES problem is obtained if one consideres minimization of \(|p(A) |\) instead of \(|p(A)b|\) as in the GMRES algorithm.
Kim-Chuan Toh
exaly +2 more sources
GMRES with Deflated Restarting
SIAM Journal of Scientific Computing, 2002A new version of the generalized minimal residuum (GMRES) algorithm for solving large systems of linear equations is described. It uses a ``deflated restarting'' and at each cycle a recurrence similar to the Arnoldi's one is generated. The new algorithm has about the same storage and expense requirements as GMRES with implicitly restarted Arnoldi ...
Ronald Morgan
exaly +3 more sources

