Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Joseph W. H. Liu"'
Autor:
Stanley C. Eisenstat, Joseph W. H. Liu
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 29:1363-1381
The elimination tree of a symmetric matrix plays an important role in sparse elimination. We recently defined a generalization of this structure to the unsymmetric case that retains many of its properties. Here we present an algorithm for constructin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1df955c06a8727080662b75c1b3fe41
https://doi.org/10.1137/050643581
https://doi.org/10.1137/050643581
Autor:
Joseph W. H. Liu, Stanley C. Eisenstat
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 26:686-705
The elimination tree of a symmetric matrix plays an important role in sparse matrix factorization. By using paths instead of edges to define the tree, we generalize this structure to unsymmetric matrices while retaining many of its properties. If we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1db5b8b08356c7c6878dd66884e1e34d
https://doi.org/10.1137/s089547980240563x
https://doi.org/10.1137/s089547980240563x
Autor:
Joseph W. H. Liu, Alan D. George
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 20:953-969
The authors designed and implemented a sparse matrix package called Sparspak in the late 1970s. One of the important features of that package is an interface which shields the user from the complicated calling sequences common to most sparse matrix s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c17047dbab9ba0bf350f5502fd4ec79
https://doi.org/10.1137/s0895479897317739
https://doi.org/10.1137/s0895479897317739
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 20:720-755
We investigate several ways to improve the performance of sparse LU factorization with partial pivoting, as used to solve unsymmetric linear systems. We introduce the notion of unsymmetric supernodes to perform most of the numerical computation in de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cb70695e0c224ecae6d7b37d426c302
https://doi.org/10.1137/s0895479895291765
https://doi.org/10.1137/s0895479895291765
Autor:
Joseph W. H. Liu, Baining Guo
Publikováno v:
Computer Vision and Image Understanding. 72:328-339
The computation of visible surfaces is usually formulated in a regularization framework based on thin-plate and membrane splines. When discretized, this formulation leads to large sparse linear systems. Most surface interpolation methods solve these
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da95a6e3758194a926e30a072d43e10b
https://doi.org/10.1006/cviu.1997.0668
https://doi.org/10.1006/cviu.1997.0668
Autor:
Joseph W. H. Liu, Cleve Ashcraft
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 19:816-832
In this paper we provide a robust reordering scheme for sparse matrices. The scheme relies on the notion of multisection, a generalization of bisection. The reordering strategy is demonstrated to have consistently good performance in terms of fill re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10388331081a0290b0f967da8e7c9aa5
https://doi.org/10.1137/s0895479896299081
https://doi.org/10.1137/s0895479896299081
Autor:
Joseph W. H. Liu, Cleve Ashcraft
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 19:325-354
In this paper, we consider the use of the Dulmage--Mendelsohn decomposition and network flow on bipartite graphs to improve a graph bisection partition. Given a graph partition [B, W, S] with a vertex separator S and two disconnected components B and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::972e517a616d33de5a5968ab1688961b
https://doi.org/10.1137/s0895479896308433
https://doi.org/10.1137/s0895479896308433
Autor:
Joseph W. H. Liu, Cleve Ashcraft
Publikováno v:
BIT Numerical Mathematics. 37:506-534
In this paper we introduce a three-step approach to find a vertex bisector of a graph. The first step finds adomain decomposition of the graph, consisting of a set of domains and a multisector. Eachdomain is a connected subgraph, and themultisector c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28ea14eb44432218fc5bbd0a4b546ca0
https://doi.org/10.1007/bf02510238
https://doi.org/10.1007/bf02510238
Autor:
John R. Gilbert, Joseph W. H. Liu
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 14:334-352
The elimination tree is central to the study of Cholesky factorization of sparse symmetric positive definite matrices. In this paper, the elimination tree is generalized to a structure appropriate for the sparse $LU$ factorization of unsymmetric matr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1e1efe7187d50441f9647d531bbd2ed
https://doi.org/10.1137/0614024
https://doi.org/10.1137/0614024
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 14:242-252
A simple characterization of fundamental supernodes is given in terms of the row subtrees of sparse Cholesky factors in the elimination tree. Using this characterization, an efficient algorithm is presented that determines the set of such supernodes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::291861d33da6762b0e5f207badeca5ac
https://doi.org/10.1137/0614019
https://doi.org/10.1137/0614019