[ Selected ]
[ PC-Comp ]
[ Personal ]
[ Thanks ]
[ GuestBook ]
[ EVENTS ] [ SOCIETIES ] [ REPORTS ] [ THESIS ]
[ PUBLICATIONS ] [ DIGITAL LIBRARIES ] [ ABSTRACTS ]
[ BIBLIOGRAPHIES ] [ INFORMATION ] [ NEWS ] [ BOOKS ]
[ INSTITUTIONS ] [ SOFTWARE ] [ MATRICES ] [ RESEARCHERS ]
[ WEB SEARCH ]
[ Sparse Linear Systems ]
[ Positive Definite Linear Systems ]
[ Indefinite Linear Systems ]
[ Sparse Factorization ]
[ Sparse Orderings ]
[ Minimum Degree ]
[ Minimum Local Fill-In ]
[ Approximate Degree ]
[ Nested Dissection ]
[ Incomplete Factorization ]
[ Preconditioners ]
[ Direct Methods ]
[ Iterative Methods ]
[ Sparse Elimination ]
[ Test Matrices ]
[ Linear Equations ]
[ Sparse Matrix ]
[ Matrix Computations ]
[ Sparse Solvers ]
[ Gaussian Elimination ]
[ Cholesky Factorization ]
[ Computational Linear Algebra ]
[ Sparse Vectors ]
[ Partitioned Inverse ]
[ Graph Separators ]
[ Node Orderings ]
EVENTS
NetLib Conference Database | ACM Events Calendar |
SOCIETIES
REPORTS
|
|
|
|
PUBLICATIONS
Back to Publications
Back to Index
DIGITAL LIBRARIES
Membership and E-accounts Required | |
|
|
|
|
|
|
[ Sparse ] [ Matrix ] [ Linear Systems ] [ Sparse Linear Systems ] [ Sparse Matrix ] [ Matrix Factorization ]
Registration or E-account Required
[ Sparse ] [ Matrix ] [ Linear Systems ] [ Sparse Linear Systems ] [ Sparse Matrix ] [ Matrix Factorization ]
Institutional or Individual Subscription Required
[ Sparse ] [ Matrix ] [ Linear Systems ] [ Sparse Linear Systems ] [ Sparse Matrix ] [ Matrix factorization ]
Online Subscription and E-account Required
No Membership Required
Back to Digital Libraries
Back to Index
ABSTRACTS
BIBLIOGRAPHIES
INFORMATION RESOURCES
NEWS
BOOKS
|
|
|
|
[ Sparse Systems ]
[ Sparse ]
[ Matrix ]
[ Linear ]
[ Equations ]
[ Linear Algebra ]
[ Direct ]
[ Iterative ]
[ Parallel ]
[ Numerical ]
[ Methods ]
[ Scientific ]
[ Computing ]
[ Finite Elements ]
[ Least Squares ]
[ Multigrid ]
[ Adaptive ]
[ Grid ]
[ Generation ]
[ Mesh ]
[ Partitioning ]
[ Graph ]
[ Algorithms ]
[ Interior Point ]
[ Approximate ]
[ Solution ]
[ Precond ]
[ Conjugate ]
[ Incomplete ]
[ Factorization ]
[ Sparse Matrices ] [ Iterative Methods ] [ Linear Algebra ] [ Equations ] [ Matrices ] [ Computer Mathematics ]
Browse Amazon for Selected Books on
[ Matrices ] [ Computer Mathematics ] [ Applied Mathematics ] [ Graph Theory ] [ Linear Programming ]
SIAM Books on
[ Linear Algebra and Matrix Theory ] [ Computational Mathematics ]
INSTITUTIONS
SOFTWARE
|
|
|
|
GAMS Symmetric Positive Definite Banded Linear Systems Software
GAMS Associated Operations (Matrix Reordering) Software
GAMS Nonsymmetric Sparse Linear Systems Software
GAMS Complex Non-Hermitian Sparse Linear Systems Software
GAMS Classes List
GAMS Problem Taxonomy
OTHER SOURCES OF SOFTWARE
Back to Software
Back to Index
MATRICES
Back to Matrices
Back to Index
AMS / SIAM Membership List | ACM Membership List |
WEB SEARCH
Meta Search Interfaces | |
Web Indexes | |
[ Sparse Factorization ]
[ Sparse Orderings ]
[ Minimum Degree ]
[ Minimum Local Fill-In ]
[ Approximate Degree ]
[ Nested Dissection ]
[ Incomplete Factorization ]
[ Preconditioners ]
[ Direct Methods ]
[ Iterative Methods ]
[ Sparse Elimination ]
[ Test Matrices ]
[ Linear Equations ]
[ Sparse Matrix ]
[ Matrix Computations ]
[ Sparse Solvers ]
[ Gaussian Elimination ]
[ Cholesky Factorization ]
[ Computational Linear Algebra ]
[ Sparse Vectors ]
[ Partitioned Inverse ]
[ Graph Separators ]
[ Node Orderings ]
The following keywords can be recorded as Name Tags in browsers bookmarks, allowing a quick return to their respective Search Points on this page.For example to mark the location for Searches to Sparse Linear Systems, one may save a bookmark to this page [ http://.../spars-ls.html ] and edit it in order to point to [ http://.../spars-ls.html#Sparse Linear Systems ].
A click on each of the Keywords Links themselves, can be used to Return to the Keywords Index at the top of this section.
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
[ MetaCrawler ] [ AltaVista ] [ Excite ] [ InfoSeek ] [ HotBot ] [ Lycos ] [ WebCrawler ] [ UCSTRI ] [ NCSTRL ]
Back to Web Search
Back to Index
Dr. Ricardo Duarte Arantes
http://www2.lncc.br/~duarte/main.html
http://home.openlink.com.br/sparse/main.html
http://www.domain.com.br/clientes/sparse/main.html
http://www.geocities.com/CapeCanaveral/6160/main.html
Bibliographic References on Sparse Linear Systems
http://www2.lncc.br/~duarte/sparsbib.html
http://www.domain.com.br/clientes/sparse/sparsbib.html
http://www.geocities.com/CapeCanaveral/6160/sparsbib.html
http://liinwww.ira.uka.de/bibliography/Math/sparse.linear.systems.html
NA-Net: na.rarantes
Department of Computational and Applied Mathematics
Mail Address:
Ricardo Duarte Arantes
Caixa Postal 11502, Copacabana
22022-970, Rio de Janeiro, RJ
Brazil