On the public citation graph
On Block Elimination for Sparse Linear Systems
0 signed · 86 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_14openalex-snapshot
Several Strategies for Reducing the Bandwidth of Matrices
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_4openalex-snapshot
Some Basic Techniques for Solving Sparse Systems of Linear Equations
inferredcites →https://doi.org/10.1016/0022-247x(74)90179-6openalex-snapshot
Partitioning, tearing and modification of sparse linear systems
inferredcites →https://doi.org/10.1016/0041-5553(66)90153-4openalex-snapshot
The algebraic eigenvalue problem
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0264857-9openalex-snapshot
Elliptic Spline Functions and the Rayleigh-Ritz-Galerkin Method
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0275643-8openalex-snapshot
Some Results on Sparse Matrices
inferredcites →https://doi.org/10.1093/comjnl/9.3.281openalex-snapshot
A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations
inferredcites →https://doi.org/10.1112/jlms/s1-40.1.378bopenalex-snapshot
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.2307/2314680openalex-snapshot
The Theory of Matrices in Numerical Analysis.
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)1097-0207(20000430)47:12<1997::aid-nme864>3.0.co;2-7openalex-snapshot
An efficient solution method for finite element ring-rolling simulation
inferred← citeshttps://doi.org/10.1002/aic.690250406openalex-snapshot
Maintaining sparsity in process design calculations
inferred← citeshttps://doi.org/10.1002/aic.690431207openalex-snapshot
Global preordering for Newton equations using model hierarchy
inferred← citeshttps://doi.org/10.1002/cta.4490090102openalex-snapshot
Algorithms for solution updating due to large changes in system parameters
inferred← citeshttps://doi.org/10.1002/nme.1620201004openalex-snapshot
The design of a variable‐step integrator for the simulation of gas transmission networks
inferred← citeshttps://doi.org/10.1002/num.1690090206openalex-snapshot
An organization of sparse gauss elimination for solving partial differntial equations on distributed memory machines
inferred← citeshttps://doi.org/10.1007/978-3-642-85972-4_1openalex-snapshot
Sparse Matrix Aspects of the Finite Element Method
inferred← citeshttps://doi.org/10.1007/bf00583669openalex-snapshot
Application of sparse matrix techniques to inter-regional input-output analysis
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bfb0067698openalex-snapshot
An automatic one-way dissection algorithm for irregular finite element problems
inferred← citeshttps://doi.org/10.1007/bfb0116615openalex-snapshot
Solution of linear systems of equations: Direct methods for finite element problems
inferred← citeshttps://doi.org/10.1007/s10470-018-1135-3openalex-snapshot
On the minimal time for the process of analog circuit optimization
inferred← citeshttps://doi.org/10.1016/0022-247x(74)90179-6openalex-snapshot
Partitioning, tearing and modification of sparse linear systems
inferred← citeshttps://doi.org/10.1016/0098-1354(80)87004-9openalex-snapshot
Exploiting border structure in solving large sparse linear systems in bordered triangular form
inferred← citeshttps://doi.org/10.1016/0098-1354(82)87005-1openalex-snapshot
On efficient solution of large-scale Newton-Raphson-based flowsheeting problems in limited core
inferred← citeshttps://doi.org/10.1016/0098-1354(82)87006-3openalex-snapshot
On efficient solution of complex systems of interlinked multistage separators
inferred← citeshttps://doi.org/10.1016/0098-1354(84)80011-3openalex-snapshot
Sparse matrix methods for equation-based chemical process flowsheeting—I
inferred← citeshttps://doi.org/10.1016/0098-1354(84)80012-5openalex-snapshot
Sparse Matrix Methods for equation-based chemical process flowshweeting—II
inferred← citeshttps://doi.org/10.1016/0898-1221(78)90010-xopenalex-snapshot
Analysis of dissection algorithms for vector computers
inferred← citeshttps://doi.org/10.1016/b978-0-08-021295-1.50008-0openalex-snapshot
COMPLEXITY OF VECTORIZED SOLUTION OF TWO-DIMENSIONAL FINITE ELEMENT GRIDS**This research was supported by the Mathematical and Information Sciences Directorate of the Air Force Office of Scientific Research under Grant 75-2812.
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50008-8openalex-snapshot
BLOCK METHODS FOR SOLVING SPARSE LINEAR SYSTEMS
inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00005-7openalex-snapshot
Undulant-block elimination and integer-preserving matrix inversion
inferred← citeshttps://doi.org/10.1016/s0377-0427(99)00132-6openalex-snapshot
A parallelizable preconditioner for the iterative solution of implicit Runge–Kutta-type methods
inferred← citeshttps://doi.org/10.1016/s1570-8659(00)07002-2openalex-snapshot
Gaussian elimination for the solution of linear systems of equations
inferred← citeshttps://doi.org/10.1016/s1570-8659(04)13006-8openalex-snapshot
Modelling and Discretization of Circuit Problems
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1021/ac00148a017openalex-snapshot
Data processing techniques to extract pure-component spectra from mixture spectra and their application to polymeric systems
inferred← citeshttps://doi.org/10.1080/15326349908807565openalex-snapshot
A graph-theoretic approach to queueing analysis part ii: applications
inferred← citeshttps://doi.org/10.1088/0022-3719/13/7/007openalex-snapshot
Localisation in random systems
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.8.1707openalex-snapshot
Separatrix Conception for Trajectory Analysis of Analog Networks Design in Minimal Time
inferred← citeshttps://doi.org/10.1093/imanum/11.3.299openalex-snapshot
An Algorithm for Large-Scale Quadratic Programming
inferred← citeshttps://doi.org/10.1108/03321641311305791openalex-snapshot
Characteristics study of an electronic systems design strategy
inferred← citeshttps://doi.org/10.1108/compel-09-2019-0370openalex-snapshot
Analysis of the structure of different optimization strategies
inferred← citeshttps://doi.org/10.1108/compel-10-2013-0324openalex-snapshot
Analog circuit optimization on basis of control theory approach
inferred← citeshttps://doi.org/10.1109/cadsm.2007.4297477openalex-snapshot
Analysis of the Main Properties for a Minimal-Time Circuit Design Process
inferred← citeshttps://doi.org/10.1109/cadsm.2007.4297482openalex-snapshot
Circuit Design Process as Dynamic Controllable System
inferred← citeshttps://doi.org/10.1109/cadsm.2015.7230859openalex-snapshot
Comparison of Lyapunov function behavior for different strategies of optimization
inferred← citeshttps://doi.org/10.1109/cadsm.2015.7230884openalex-snapshot
Study of structure of the control vector for the best optimization strategy
inferred← citeshttps://doi.org/10.1109/ewdts.2011.6116592openalex-snapshot
Lyapunov function analysis for different strategies of circuit optimization
inferred← citeshttps://doi.org/10.1109/ewdts.2014.7027057openalex-snapshot
Control vector structure for circuit optimization
inferred← citeshttps://doi.org/10.1109/inds.2011.6024836openalex-snapshot
Characteristics study of an electronic systems design strategy that includes the traditional strategy and the modified traditional strategy
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206258openalex-snapshot
The structure determination for the time-optimal system design algorithm
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1109/proc.1978.11117openalex-snapshot
Formulation of multiport equations via block matrix elimination
inferred← citeshttps://doi.org/10.1109/robot.1992.220248openalex-snapshot
A new approach to the numerical solution of constrained mechanical system dynamics
inferred← citeshttps://doi.org/10.1109/tcs.1979.1084693openalex-snapshot
A multilevel Newton algorithm with macromodeling and latency for the analysis of large-scale nonlinear circuits in the time domain
inferred← citeshttps://doi.org/10.1109/tcs.1980.1084825openalex-snapshot
Sparsity considerations in network solution by tearing
inferred← citeshttps://doi.org/10.1137/0713066openalex-snapshot
A Negative Result on Sparse Matrix Splitting and Gaussian Elimination
inferred← citeshttps://doi.org/10.1137/0714011openalex-snapshot
Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
inferred← citeshttps://doi.org/10.1137/0715021openalex-snapshot
Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
inferred← citeshttps://doi.org/10.1137/0715069openalex-snapshot
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
inferred← citeshttps://doi.org/10.1137/0722022openalex-snapshot
A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
inferred← citeshttps://doi.org/10.1137/0911053openalex-snapshot
Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices
inferred← citeshttps://doi.org/10.1137/21m1416552openalex-snapshot
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
inferred← citeshttps://doi.org/10.1137/s0036142999360573openalex-snapshot
Inexact Simplified Newton Iterations for Implicit Runge-Kutta Methods
inferred← citeshttps://doi.org/10.1145/355791.355796openalex-snapshot
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
inferred← citeshttps://doi.org/10.1179/003962690791486118openalex-snapshot
APPLICATION OF GRAPH THEORY TO THE ORDERING OF LARGE SURVEY NETWORKS
inferred← citeshttps://doi.org/10.13053/cys-7-1-1049openalex-snapshot
One approach to the time-optimal strategy formulation for analog circuit design
inferred← citeshttps://doi.org/10.20535/s002134701706005xopenalex-snapshot
Применение принципа максимума для оптимизации цепей
inferred← citeshttps://doi.org/10.2118/11877-paopenalex-snapshot
Fully Coupled Multiblock Wells in Oil Simulation
inferred← citeshttps://doi.org/10.2118/12263-msopenalex-snapshot
Practical Considerations for Incomplete Factorization Methods in Reservoir Simulation
inferred← citeshttps://doi.org/10.2172/4094openalex-snapshot
Development of an Improved Permeability Modification Simulator
inferred← citeshttps://doi.org/10.22201/icat.16656423.2004.2.01.580openalex-snapshot
On time-optimal procedure for analog system design
inferred← citeshttps://doi.org/10.3103/s073527271706005xopenalex-snapshot
Application of the maximum principle for the circuits optimization
inferred← citeshttps://doi.org/10.37394/23201.2022.21.18openalex-snapshot
On the Structure of a Quasi-Optimal Algorithm for Circuit Designing
inferred← citeshttps://doi.org/10.37394/232017.2021.12.9openalex-snapshot
On a Quasi Optimal Algorithm for Analog Circuits Optimization
inferred← citeshttps://doi.org/10.37394/23202.2021.20.15openalex-snapshot
Study of the Start Point of Optimization Trajectories for Complex Strategies of the Circuit Design Process
inferred← citeshttps://doi.org/10.37394/23205.2021.20.38openalex-snapshot
Circuit Optimization Study According to the Maximum Principle
inferred← citeshttps://doi.org/10.4018/978-1-4666-6627-6.ch004openalex-snapshot
Stability of Optimization Trajectories for Designing Analog Circuits
inferred← citeshttps://doi.org/10.5772/6314openalex-snapshot
Network Optimization as a Controllable Dynamic Process
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.