On the public citation graph

Factorized sparse approximate inverse preconditionings. III. Iterative construction of preconditioners

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1099-1506(199709/10)4:5<393::aid-nla114>3.0.co;2-ropenalex-snapshot
Block SSOR preconditionings for high-order 3D FE systems. III: Incomplete BSSOR preconditionings based onp-partitionings
inferredcites →https://doi.org/10.1002/nla.1680010208openalex-snapshot
New convergence results and preconditioning strategies for the conjugate gradient method
inferredcites →https://doi.org/10.1016/0024-3795(75)90112-3openalex-snapshot
A lower bound for the smallest singular value of a matrix
inferredcites →https://doi.org/10.1016/0024-3795(80)90247-5openalex-snapshot
The block conjugate gradient algorithm and related methods
inferredcites →https://doi.org/10.1016/0024-3795(92)90016-4openalex-snapshot
A lower bound for the smallest singular value
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50023-4openalex-snapshot
A GENERALIZED CONJUGATE GRADIENT METHOD FOR THE NUMERICAL SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS
inferredcites →https://doi.org/10.1017/cbo9780511840371openalex-snapshot
Topics in Matrix Analysis
inferredcites →https://doi.org/10.1080/00207169108804011openalex-snapshot
Simulated annealing with extended neighbourhood
inferredcites →https://doi.org/10.1080/00207169208804103openalex-snapshot
Explicitly preconditioned conjugate gradient method for the solution of unsymmetric linear systems
inferredcites →https://doi.org/10.1137/0614004openalex-snapshot
Factorized Sparse Approximate Inverse Preconditionings I. Theory
inferredcites →https://doi.org/10.1137/s1064827594271421openalex-snapshot
A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
inferredcites →https://doi.org/10.1137/s1064827595281575openalex-snapshot
Approximate Inverse Techniques for Block-Partitioned Matrices
inferredcites →https://doi.org/10.1137/s1064827595294691openalex-snapshot
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1142/s0129053395000117openalex-snapshot
FACTORIZED SPARSE APPROXIMATE INVERSE PRECONDITIONING II: SOLUTION OF 3D FE SYSTEMS ON MASSIVELY PARALLEL COMPUTERS
inferredcites →https://doi.org/10.1515/rnam.1986.1.4.293openalex-snapshot
On a family of two-level preconditionings of the incomplete block factorization type
inferredcites →https://doi.org/10.2307/2153309openalex-snapshot
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199910/11)6:7<515::aid-nla176>3.0.co;2-0openalex-snapshot
Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
inferred← citeshttps://doi.org/10.1002/mma.6502openalex-snapshot
Incomplete block‐matrix factorization of M‐matrices using two‐step iterative method for matrix inversion and preconditioning
inferred← citeshttps://doi.org/10.1002/mop.22333openalex-snapshot
Robust GMRES recursive method for fast finite element analysis of 3D electromagnetic problems
inferred← citeshttps://doi.org/10.1002/nag.1012openalex-snapshot
Parallel solution to ill‐conditioned FE geomechanical problems
inferred← citeshttps://doi.org/10.1002/nla.286openalex-snapshot
Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings
inferred← citeshttps://doi.org/10.1002/nla.345openalex-snapshot
Sparse symmetric preconditioners for dense linear systems in electromagnetism
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_11openalex-snapshot
Sparse Approximate Inverse Preconditioners
inferred← citeshttps://doi.org/10.1016/j.apnum.2015.12.007openalex-snapshot
A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
inferred← citeshttps://doi.org/10.1016/j.cam.2007.07.003openalex-snapshot
New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
inferred← citeshttps://doi.org/10.1016/j.jocs.2025.102736openalex-snapshot
Parallel sparsity patterns for factored incomplete inverse matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2020.06.017openalex-snapshot
Supporting theory for a block approximate inverse preconditioner
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00118-4openalex-snapshot
A comparative study of sparse approximate inverse preconditioners
inferred← citeshttps://doi.org/10.1023/b:joth.0000026282.08256.45openalex-snapshot
Factorized-Sparse-Approximate-Inverse Preconditionings of Linear Systems with Unsymmetric Matrices
inferred← citeshttps://doi.org/10.1109/apmc.2005.1606663openalex-snapshot
Diagonally Perturbed Incomplete Cholesky Preconditioned CG Method for A− V Formulation of FEM
inferred← citeshttps://doi.org/10.1134/s0965542521110099openalex-snapshot
Iterative Preconditioned Methods in Krylov Spaces: Trends of the 21st Century
inferred← citeshttps://doi.org/10.1137/090779760openalex-snapshot
A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
inferred← citeshttps://doi.org/10.1137/20m1336254openalex-snapshot
Sparse Cholesky Factorization by Kullback--Leibler Minimization
inferred← citeshttps://doi.org/10.1137/23m1606253openalex-snapshot
Sparse Inverse Cholesky Factorization of Dense Kernel Matrices by Greedy Conditional Selection
inferred← citeshttps://doi.org/10.1145/3658199openalex-snapshot
Lightning-fast Method of Fundamental Solutions
inferred← citeshttps://doi.org/10.1155/2019/1912535openalex-snapshot
Approximate Schur‐Block ILU Preconditioners for Regularized Solution of Discrete Ill‐Posed Problems
inferred← citeshttps://doi.org/10.14713/ejbe.v7i1.952openalex-snapshot
Algebraic preconditioners for the Fast Multipole Method in electromagnetic scattering analysis from large structures: trends and problems
inferred← citeshttps://doi.org/10.4203/csets.17.8openalex-snapshot
Algebraic Domain Decomposition Preconditioners
inferred← citeshttps://doi.org/10.4236/am.2020.114023openalex-snapshot
Explicit Iterative Methods of Second Order and Approximate Inverse Preconditioners for Solving Complex Computational Problems
inferred← citeshttps://doi.org/10.5540/tcam.2022.023.03.00471openalex-snapshot
Novas versões para a Inversa Aproximada em Blocos: Uma Comparação Numérica
inferred← citeshttps://doi.org/10.70675/9ea74bb0zcd35z4136zb61fz140e8e1ff3ecopenalex-snapshot
On the design of sparse hybrid linear solvers for modern parallel architectures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.