Cargando…

On algorithms for permuting large entries to the diagonal of a sparse matrix

Detalles Bibliográficos
Autores principales:	Duff, I S, Köster, L J
Lenguaje:	eng
Publicado:	1999
Materias:	Mathematical Physics and Mathematics
Acceso en línea:	http://cds.cern.ch/record/428407

Ejemplares similares

The design and use of algorithms for permuting large entries to the diagonal of sparse matrices
por: Duff, I S, et al.
Publicado: (1997)

Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
por: Duff, I S, et al.
Publicado: (1995)

A survey of sparse matrix software
por: Duff, I S
Publicado: (1982)

Symposium on Sparse Matrix Computations
por: Duff, Iain S, et al.
Publicado: (1979)

Matrix diagonal stability in systems and computation
por: Kaszkurewicz, Eugenius, et al.
Publicado: (2000)

Permutation group algorithms
por: Seress, Ákos
Publicado: (2003)

PARASOL: an integrated programming environment for parallel sparse matrix solvers
por: Amestoy, P R, et al.
Publicado: (1998)

Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
por: Hu, Y, et al.
Publicado: (2003)

The sparse BLAS
por: Duff, I S, et al.
Publicado: (2001)

Low rank matrix approximation using the Lanczos bi-diagonalization process
por: Simon, H D, et al.
Publicado: (1997)

Sparse matrix technology
por: Pissanetzky, Sergio
Publicado: (1984)

Diagonalization in formal mathematics
por: Santos, Paulo Guilherme
Publicado: (2020)

Direct methods for sparse matrices
por: Duff, I S, et al.
Publicado: (1986)

Symposium on Sparse Matrix Computations
por: Bunch, James R, et al.
Publicado: (1976)

Conference on Sparse Matrices and their Uses
por: Duff, Iain S
Publicado: (1981)

Sparse numerical linear algebra: direct methods and preconditioning
por: Duff, I S
Publicado: (1996)

Permutation Methods
por: Mielke, Paul W, et al.
Publicado: (2007)

On the diagonalization of principal submatrices of positive-definitive symmetric matrices, pt 1; properties of the diagonal elements
por: Daneels, A
Publicado: (1972)

A comparison of frontal software with other sparse direct solvers
por: Duff, I S, et al.
Publicado: (1996)

Omega: a competent genetic algorithm for solving permutation and scheduling problems
por: Knjazew, Dimitri, et al.
Publicado: (2002)

A combined unifrontal/multifrontal method for unsymmetric sparse matrices
por: Davis, T A, et al.
Publicado: (1997)

Permutation groups
por: Dixon, John, et al.
Publicado: (1996)

Combinatorics of permutations
por: Bona, Miklos
Publicado: (2012)

Sparse symmetric preconditioners for dense linear systems in electromagnetism
por: Carpentieri, B, et al.
Publicado: (2002)

MA28: a set of Fortran subroutines for sparse unsymmetric linear equations
por: Duff, I S
Publicado: (1980)

MA57 - a new code for the solution of sparse symmetric definite systems
por: Duff, I S
Publicado: (2002)

Optical theorem and off-diagonal elements of the Tmatrix
por: Földy, L L
Publicado: (1964)

Graph theory and sparse matrix computation
por: George, Alan, et al.
Publicado: (1993)

MA32 - a package for solving sparse unsymmetric systems using the frontal method
por: Duff, I S
Publicado: (1981)

Algorith xxx: a reference model implementation of the sparse BLAS in Fortan 95
por: Duff, I S, et al.
Publicado: (2002)

Representations of permutation groups
por: Kerber, Adalbert
Publicado: (1971)

Finite permutation groups
por: Wielandt, Helmut, et al.
Publicado: (1964)

Patterns in Permutations and Words
por: Kitaev, Sergey
Publicado: (2011)

Representations of permutation groups
por: Kerber, Adalbert
Publicado: (1975)

Ordered permutation groups
por: Glass, A M W
Publicado: (1982)

Permutation groups and combinatorial structures
por: Biggs, Norman L, et al.
Publicado: (1979)

Deterministic global optimization: an introduction to the diagonal approach
por: Sergeyev, Yaroslav D, et al.
Publicado: (2017)

Diagonalizing compact operators on Hilbert W$*$-modules
por: Frank, M, et al.
Publicado: (1994)

Arithmetic of diagonal hypersurfaces over finite fields
por: Gouvêa, Fernando Q, et al.
Publicado: (1995)

The design of MA48, a code for the direct solution of sparse unsymmetric linear systems of equations
por: Duff, I S, et al.
Publicado: (1995)

Cannot write session to /tmp/vufind_sessions/sess_p541mqs9gmqjlt0b5rk589nvk3