On the public citation graph

Improved Balanced Incomplete Factorization

0 signed · 52 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/1099-1506(200104/05)8:3<165::aid-nla235>3.0.co;2-9openalex-snapshot
A robust AINV-type method for constructing sparse approximate inverse preconditioners in factored form
inferredcites →https://doi.org/10.1002/nla.1680010405openalex-snapshot
ILUT: A dual threshold incomplete LU factorization
inferredcites →https://doi.org/10.1002/nla.320openalex-snapshot
A robust incomplete factorization preconditioner for positive definite matrices
inferredcites →https://doi.org/10.1002/nla.329openalex-snapshot
AMLI preconditioner for the p ‐version of the FEM
inferredcites →https://doi.org/10.1002/nme.1620180804openalex-snapshot
Yale sparse matrix package I: The symmetric codes
inferredcites →https://doi.org/10.1002/sapm1953321180openalex-snapshot
The Vector Method of Solving Simultaneous Linear Equations
inferredcites →https://doi.org/10.1016/0024-3795(94)00192-8openalex-snapshot
A new pivoting strategy for Gaussian elimination
inferredcites →https://doi.org/10.1016/j.amc.2009.12.034openalex-snapshot
A class of preconditioners based on matrix splitting for nonsymmetric linear systems
inferredcites →https://doi.org/10.1016/s0024-3795(01)00385-8openalex-snapshot
A robust ILU with pivoting based on monitoring the growth of the inverse factors
inferredcites →https://doi.org/10.1023/a:1021946924741openalex-snapshot
Incremental Norm Estimation for Dense and Sparse Matrices
inferredcites →https://doi.org/10.1080/14786444608561331openalex-snapshot
XVI. An escalator process for the solution of linear simultaneous equations
inferredcites →https://doi.org/10.1093/qjmam/1.1.149openalex-snapshot
NOTES ON THE SOLUTION OF ALGEBRAIC LINEAR SIMULTANEOUS EQUATIONS
inferredcites →https://doi.org/10.1137/0611021openalex-snapshot
Incremental Condition Estimation
inferredcites →https://doi.org/10.1137/0614004openalex-snapshot
Factorized Sparse Approximate Inverse Preconditionings I. Theory
inferredcites →https://doi.org/10.1137/070696088openalex-snapshot
Balanced Incomplete Factorization
inferredcites →https://doi.org/10.1137/1037124openalex-snapshot
A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
inferredcites →https://doi.org/10.1137/s0895479800372110openalex-snapshot
On the Relations between ILUs and Factored Approximate Inverses
inferredcites →https://doi.org/10.1137/s0895479895284944openalex-snapshot
Estimating the Attainable Accuracy of Recursively Computed Residual Methods
inferredcites →https://doi.org/10.1137/s0895479897317661openalex-snapshot
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
inferredcites →https://doi.org/10.1137/s0895479899358443openalex-snapshot
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
inferredcites →https://doi.org/10.1137/s1064827502403411openalex-snapshot
A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
inferredcites →https://doi.org/10.1137/s1064827502405094openalex-snapshot
Crout Versions of ILU for General Sparse Matrices
inferredcites →https://doi.org/10.1137/s1064827502407524openalex-snapshot
Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
inferredcites →https://doi.org/10.1137/s1064827594271421openalex-snapshot
A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
inferredcites →https://doi.org/10.1137/s1064827595294691openalex-snapshot
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1137/s1064827599356900openalex-snapshot
Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
inferredcites →https://doi.org/10.1137/s1064827599361308openalex-snapshot
Preconditioning Highly Indefinite and Nonsymmetric Matrices
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1214/aoms/1177729893openalex-snapshot
Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.6028/jres.049.044openalex-snapshot
Methods of conjugate gradients for solving linear systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nla.2080openalex-snapshot
A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_11openalex-snapshot
Sparse Approximate Inverse Preconditioners
inferred← citeshttps://doi.org/10.1007/s10543-010-0299-8openalex-snapshot
The importance of structure in incomplete factorization preconditioners
inferred← citeshttps://doi.org/10.1007/s11075-016-0151-6openalex-snapshot
Low-rank updates of balanced incomplete factorization preconditioners
inferred← citeshttps://doi.org/10.1007/s13398-022-01334-1openalex-snapshot
Balanced incomplete factorization preconditioner with pivoting
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2016.10.005openalex-snapshot
An adaptive multilevel factorized sparse approximate inverse preconditioning
inferred← citeshttps://doi.org/10.1016/j.cam.2018.08.033openalex-snapshot
A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems
inferred← citeshttps://doi.org/10.1016/j.compstruc.2012.02.009openalex-snapshot
Implementation of a direct procedure for critical point computations using preconditioned iterative solvers
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/j.mcm.2012.01.013openalex-snapshot
Low-rank update of preconditioners for the nonlinear Richards equation
inferred← citeshttps://doi.org/10.1109/tip.2010.2053548openalex-snapshot
Incremental Training of a Detector Using Online Sparse Eigendecomposition
inferred← citeshttps://doi.org/10.1137/130917582openalex-snapshot
On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/130922872openalex-snapshot
On Incremental Condition Estimators in the 2-Norm
inferred← citeshttps://doi.org/10.1137/130931588openalex-snapshot
Preconditioned Iterative Methods for Solving Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/15m1030315openalex-snapshot
Factorized Approximate Inverses with Adaptive Dropping
inferred← citeshttps://doi.org/10.1515/auom-2015-0044openalex-snapshot
Preconditioners based on the ISM factorization
inferred← citeshttps://doi.org/10.2478/auom-2024-0006openalex-snapshot
An inverse LU preconditioner based on the Sherman–Morrison formula
inferred← citeshttps://doi.org/10.4995/thesis/10251/104923openalex-snapshot
On Updating Preconditioners for the Iterative Solution of Linear Systems
inferred← citeshttps://doi.org/10.5540/03.2015.003.01.0097openalex-snapshot
An overview of approximate inverse methods
inferred← citeshttps://doi.org/10.5540/03.2017.005.01.0093openalex-snapshot
Nova implementacao do precondicionador AINV em acelerador NVIDIA utilizando a biblioteca CUSP
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
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.