Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Barry W. Peyton"'
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 42:1337-1364
In 2017 Pichon et al. introduced an effective method for reordering columns within supernodes based on reformulating the underlying optimization problem as a set of traveling salesman problems (TSP...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98884277044322f932450762de301054
https://doi.org/10.1137/20m1368070
https://doi.org/10.1137/20m1368070
Autor:
Barry W. Peyton, Pinar Heggernes
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 30:1424-1444
Minimal elimination orderings were introduced by Rose, Tarjan, and Lueker in 1976, and during the last decade they have received increasing attention. Such orderings have important applications in several different fields, and they were first studied
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb428f89ca219ff7c611d42b1ef96fcf
https://doi.org/10.1137/070680680
https://doi.org/10.1137/070680680
Publikováno v:
Algorithmica. 39:287-298
We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94894454590011b794293aa988e979b2
https://doi.org/10.1007/s00453-004-1084-3
https://doi.org/10.1007/s00453-004-1084-3
Publikováno v:
SIAM Journal on Scientific Computing. 23:563-582
We apply truncated RQ-iteration (TRQ) and the Jacobi--Davidson (JD) method to perform vibrational (eigenvalue) analysis for large-scale molecular systems. Both algorithms employ a preconditioned iterative solver to construct a low-dimensional subspac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::766ca6c0b29e67e3872763b887077086
https://doi.org/10.1137/s1064827500373668
https://doi.org/10.1137/s1064827500373668
Autor:
Barry W. Peyton
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 23:271-294
When minimum orderings proved too difficult to deal with, Rose, Tarjan, and Lueker instead studied minimal orderings and how to compute them [SIAM J. Comput., 5 (1976), pp. 266--283]. This paper introduces an algorithm that is capable of computing mu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff3be5b74f6d6652623f0b7fe2a867f0
https://doi.org/10.1137/s089547989936443x
https://doi.org/10.1137/s089547989936443x
Publikováno v:
Bit Numerical Mathematics. 41:693-710
We present algorithms to determine the number of nonzeros in each row and column of the factors of a sparse matrix, for both the QR factorization and the LU factorization with partial pivoting. The algorithms use only the nonzero structure of the inp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9d4548157a56faf675e934ae41de556
https://doi.org/10.1023/a:1021943902025
https://doi.org/10.1023/a:1021943902025
Publikováno v:
Linear Algebra and its Applications. 262:83-97
In the factorization A = QR of a sparse matrix A , the orthogonal matrix Q can be represented either explicitly (as a matrix) or implicitly (as a sequence of Householder vectors). A folk theorem states that the Householder vectors are much sparser th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4d89bbd4ca65729f47f68c9341ec115
Autor:
Barry W. Peyton, Esmond G. Ng
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 17:443-459
In $QR$ factorization of an $m \times n$ matrix $A$ ($m \geq n$), the orthogonal factor $Q$ is often stored implicitly as an $m \times n$ lower trapezoidal matrix $W$, known as the Householder matrix. When the sparsity of $A$ is to be exploited, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d27f20e83e18a67502d09fea0757e96a
https://doi.org/10.1137/s0895479892230973
https://doi.org/10.1137/s0895479892230973
Publikováno v:
Linear Algebra and its Applications. :553-588
A partitioning problem on chordal graphs that arises in the solution of sparse triangular systems of equations on parallel computers is considered. Roughly the problem is to partition a chordal graph G into the fewest transitively orientable subgraph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83213a017054b0eff7f8aca7628fb8ea