Results 151 to 160 of about 256,417 (191)

Parallel Inversion of Sparse Matrices

IEEE Power Engineering Review, 1986
This paper presents a parallel algorithm for obtaining the inverse of a large, nonsingular symmetric matrix A of dimension nxn. The inversion method proposed is based on the triangular factors of A. The task of obtaining the "sparse inverse' of A is represented by a directed acyclic graph.
Ramon Betancourt, Fernando L. Alvarado
openaire   +1 more source

On Sparse Parity Check Matrices

Designs, Codes and Cryptography, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lefmann, Hanno, Pudlák, Pavel, Savický, Petr   +2 more
openaire   +1 more source

Estimation of Sparse Jacobian Matrices

SIAM Journal on Algebraic Discrete Methods, 1983
When finding a numerical solution to a system of nonlinear equations, one often estimates the Jacobian \(J\) by finite differences. \textit{A. R. Curtis}, \textit{M. J. D. Powell} and \textit{J. K. Reid} [J. Inst. Math. Appl. 13, 117--119 (1974; Zbl 0273.65036)] presented an algorithm that reduces the number of function evaluations by taking advantage ...
Newsam, Garry N., Ramsdell, John D.
openaire   +2 more sources

Computing with sparse matrices

International Journal for Numerical Methods in Engineering, 1973
AbstractA survey of recent developments in sparse matrix technology is presented. Two fundamental areas are reviewed: Sorting and reordering techniques by which the non‐zero elements of a given sparse matrix can be rearranged to obtain a form which leads to more efficient computations.
Chow, T. S., Kowalik, J. S.
openaire   +2 more sources

Rank Detection Methods for Sparse Matrices

SIAM Journal on Matrix Analysis and Applications, 1992
The authors propose an accurate method for detecting the numerical rank of a sparse matrix, using orthogonal factorization along with a one-norm incremental condition estimator. The method uses only static data structures and is implemented with an overhead of \(O(n_ U\log n)\) operations where \(n_ U\) is the number of nonzeros in the upper triangular
Barlow, Jesse L., Vemulapati, Udaya B.
openaire   +3 more sources

Condition Number Estimation for Sparse Matrices

SIAM Journal on Scientific and Statistical Computing, 1981
The LINPACK package of linear equation solving software provides a reliable and inexpensive algorithm for estimating the condition number of a dense matrix. The direct generalization to banded or sparse matrices is reliable, but not necessarily inexpensive.
Grimes, Roger G., Lewis, John G.
openaire   +2 more sources

Sparse matrices

2021
Alexandre Ern, Jean-Luc Guermond
openaire   +1 more source

Sparse Matrices and Graphs

2015
We have already seen numerous examples of arrays and matrices being the essential entities in many aspects of numerical computing. So far we have represented arrays with the NumPy ndarray data structure, which is a heterogeneous representation that stores all the elements of the array that it represents. In many cases, this is the most efficient way to
openaire   +1 more source

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly  

Sparse matrices

Computer-Aided Design, 1973
openaire   +2 more sources