Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A [asymptotically =] R^T R up to any desired accuracy, where R is an upper triangular hierarchically semiseparable (HSS) matrix. The factorization is stable, robust, and efficient. The method com...
Uložené v:
| Vydané v: | SIAM journal on matrix analysis and applications Ročník 31; číslo 5; s. 2899 - 2920 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Philadelphia, PA
Society for Industrial and Applied Mathematics
01.01.2010
|
| Predmet: | |
| ISSN: | 0895-4798, 1095-7162 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A [asymptotically =] R^T R up to any desired accuracy, where R is an upper triangular hierarchically semiseparable (HSS) matrix. The factorization is stable, robust, and efficient. The method compresses off-diagonal blocks with rank-revealing orthogonal decompositions. In the meantime, positive semidefinite terms are automatically and implicitly added to Schur complements in the factorization so that the approximation R^T R is guaranteed to exist and be positive definite. The approximate factorization can be used as a structured preconditioner which does not break down. No extra stabilization step is needed. When A has an off-diagonal low-rank property, or when the off-diagonal blocks of A have small numerical ranks, the preconditioner is data sparse and is especially efficient. Furthermore, the method has a good potential to give satisfactory preconditioning bounds even if this low-rank property is not obvious. Numerical experiments are used to demonstrate the performance of the method. The method can be used to provide effective structured preconditioners for large sparse problems when combined with some sparse matrix techniques. The hierarchical compression scheme in this work is also useful in the development of more HSS algorithms. [PUBLICATION ABSTRACT] |
|---|---|
| AbstractList | Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A approximately R theta R up to any desired accuracy, where R is an upper triangular hierarchically semiseparable (HSS) matrix. The factorization is stable, robust, and efficient. The method compresses off-diagonal blocks with rank-revealing orthogonal decompositions. In the meantime, positive semidefinite terms are automatically and implicitly added to Schur complements in the factorization so that the approximation R theta R is guaranteed to exist and be positive definite. The approximate factorization can be used as a structured preconditioner which does not break down. No extra stabilization step is needed. When A has an off-diagonal low-rank property, or when the off-diagonal blocks of A have small numerical ranks, the preconditioner is data sparse and is especially efficient. Furthermore, the method has a good potential to give satisfactory preconditioning bounds even if this low-rank property is not obvious. Numerical experiments are used to demonstrate the performance of the method. The method can be used to provide effective structured preconditioners for large sparse problems when combined with some sparse matrix techniques. The hierarchical compression scheme in this work is also useful in the development of more HSS algorithms. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A [asymptotically =] R^T R up to any desired accuracy, where R is an upper triangular hierarchically semiseparable (HSS) matrix. The factorization is stable, robust, and efficient. The method compresses off-diagonal blocks with rank-revealing orthogonal decompositions. In the meantime, positive semidefinite terms are automatically and implicitly added to Schur complements in the factorization so that the approximation R^T R is guaranteed to exist and be positive definite. The approximate factorization can be used as a structured preconditioner which does not break down. No extra stabilization step is needed. When A has an off-diagonal low-rank property, or when the off-diagonal blocks of A have small numerical ranks, the preconditioner is data sparse and is especially efficient. Furthermore, the method has a good potential to give satisfactory preconditioning bounds even if this low-rank property is not obvious. Numerical experiments are used to demonstrate the performance of the method. The method can be used to provide effective structured preconditioners for large sparse problems when combined with some sparse matrix techniques. The hierarchical compression scheme in this work is also useful in the development of more HSS algorithms. [PUBLICATION ABSTRACT] |
| Author | Xia, Jianlin Gu, Ming |
| Author_xml | – sequence: 1 givenname: Jianlin surname: Xia fullname: Xia, Jianlin – sequence: 2 givenname: Ming surname: Gu fullname: Gu, Ming |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23817823$$DView record in Pascal Francis |
| BookMark | eNplkU9LAzEQxYNUsK0e_AaLIOJhNdmk2eRYqlWhomjvIZsmmHa7qUlWrJ_erP8O9TQD85vHvDcD0GtcowE4RvACIVxeQg7LERxBuAf6CPJRXiJa9EAfstSTkrMDMAhhCSGihKM-kE-uakPMxpuNd-92LaPOJi-u1mG1zaZSRefth4zWNZkz2ZNsVvlz9K2KrdeL7Hm7XuvorcoeXbDRvunsShvb2KRyL7uBDodg38g66KOfOgTz6fV8cpvPHm7uJuNZrjBiMSesMhwTSbBZIMUVJGRRqQJxhSouqdISMopGmhKIKqwNgiUlilJoqKRVgYfg7Fs2-XhtdYhibYPSdS0b7dogUi6cdq4TebJDLl3rm3SbYCUvGSkwTtDpDySDkrXxslE2iI1PEfmtKDBDJSs67vKbU96F4LURysavvKKXthYIiu4v4u8vaeN8Z-NX9D_7CVRsjng |
| CODEN | SJMAEL |
| CitedBy_id | crossref_primary_10_1137_130945995 crossref_primary_10_1016_j_cam_2017_11_035 crossref_primary_10_1016_j_ymssp_2017_05_018 crossref_primary_10_1137_21M1468334 crossref_primary_10_1002_nla_2046 crossref_primary_10_1002_nla_1850 crossref_primary_10_1007_s10444_022_09988_6 crossref_primary_10_1080_10618600_2019_1652616 crossref_primary_10_1137_110848062 crossref_primary_10_1137_17M1124152 crossref_primary_10_2514_1_J054180 crossref_primary_10_1002_nla_2051 crossref_primary_10_1007_s11276_021_02646_7 crossref_primary_10_1002_nla_2294 crossref_primary_10_1137_15M1021830 crossref_primary_10_1080_01621459_2021_1919122 crossref_primary_10_1137_17M1151158 crossref_primary_10_1137_130914966 crossref_primary_10_1016_j_camwa_2014_09_008 crossref_primary_10_1016_j_jcp_2021_110654 crossref_primary_10_1016_j_jcp_2019_07_024 crossref_primary_10_1137_15M1026195 crossref_primary_10_1088_1674_1056_22_8_080201 crossref_primary_10_1002_mma_3416 crossref_primary_10_1137_120870414 crossref_primary_10_1137_20M1349540 crossref_primary_10_1007_s10915_022_01917_5 crossref_primary_10_1016_j_cam_2015_09_012 crossref_primary_10_1137_23M1585039 crossref_primary_10_1137_120872735 crossref_primary_10_1137_20M1315683 crossref_primary_10_1007_s00211_013_0582_0 crossref_primary_10_1137_120903002 crossref_primary_10_1137_17M1137073 crossref_primary_10_1016_j_cam_2018_05_051 crossref_primary_10_1137_110827788 crossref_primary_10_1137_110851110 crossref_primary_10_1016_j_csda_2020_107165 crossref_primary_10_1137_16M110486X crossref_primary_10_1137_130938700 crossref_primary_10_1137_19M123806X crossref_primary_10_1016_j_jcp_2015_09_050 crossref_primary_10_1007_s10092_022_00491_4 crossref_primary_10_1002_nme_7076 crossref_primary_10_1002_nme_6166 crossref_primary_10_1007_s11222_014_9454_4 |
| Cites_doi | 10.1016/j.laa.2005.02.037 10.1090/S0025-5718-04-01716-8 10.1007/s006070050020 10.1002/nla.1680010207 10.1137/S0895479803436652 10.1090/S0025-5718-1980-0559197-0 10.1007/PL00021408 10.1016/0024-3795(87)90103-0 10.1002/nla.329 10.1145/356044.356047 10.1016/j.jcp.2004.10.033 10.1137/S1064827599356900 10.1007/BF01436084 10.1007/s00211-005-0595-4 10.1016/S0024-3795(96)00301-1 10.1007/s10092-005-0107-z 10.1137/S0895479891223781 10.1137/050636012 10.1007/s006070070031 10.1002/nla.525 10.1002/(SICI)1099-1506(199811/12)5:6<483::AID-NLA156>3.3.CO;2-Z 10.1016/j.laa.2006.10.021 10.1137/S0895479802405884 10.1007/s00607-004-0080-4 10.1137/080720693 10.1016/j.laa.2007.08.038 10.1137/0710032 10.1007/s00791-008-0098-9 10.1137/0917055 10.1002/nla.461 10.1007/s00211-002-0445-6 10.1137/040615845 10.1007/s00607-005-0146-y 10.1016/S0955-7997(02)00152-2 10.1137/0720040 10.1007/s10915-008-9240-6 10.1137/07068179X 10.1002/nme.1620200511 10.1007/s00607-002-1450-4 10.1137/09074543X |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright Society for Industrial and Applied Mathematics 2010 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright Society for Industrial and Applied Mathematics 2010 |
| DBID | AAYXX CITATION IQODW 3V. 7WY 7WZ 7X2 7XB 87Z 88A 88F 88I 88K 8AL 8FE 8FG 8FH 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI CCPQU D1I DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- KB. L.- L6V LK8 M0C M0K M0N M1Q M2O M2P M2T M7P M7S MBDVC P5Z P62 PATMY PDBOC PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYCSY Q9U 7SC 8FD L7M L~C L~D |
| DOI | 10.1137/090750500 |
| DatabaseName | CrossRef Pascal-Francis ProQuest Central (Corporate) ABI/INFORM Collection ABI/INFORM Global (PDF only) Agricultural Science Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Biology Database (Alumni Edition) Military Database (Alumni Edition) Science Database (Alumni Edition) Telecommunications (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection Agricultural & Environmental Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Business Premium Collection ProQuest Technology Collection Natural Science Collection ProQuest One Community College ProQuest Materials Science Collection ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Materials Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Biological Sciences ABI/INFORM Global Agriculture Science Database Computing Database Military Database Research Library Science Database Telecommunications Database Biological Science Database Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Environmental Science Database Materials Science Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business (OCUL) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection Environmental Science Collection ProQuest Central Basic Computer and Information Systems Abstracts Technology Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Agricultural Science Database ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest Telecommunications ProQuest One Applied & Life Sciences Natural Science Collection Biological Science Collection ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest One Academic Eastern Edition Agricultural Science Collection ProQuest Technology Collection ProQuest Telecommunications (Alumni Edition) Biological Science Database ProQuest Business Collection Environmental Science Collection ProQuest One Academic UKI Edition Environmental Science Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) Materials Science Collection ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Natural Science Collection ProQuest Biology Journals (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Agricultural & Environmental Science Collection Materials Science Database ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Materials Science Collection ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Agricultural Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1095-7162 |
| EndPage | 2920 |
| ExternalDocumentID | 2410932381 23817823 10_1137_090750500 |
| Genre | Feature |
| GroupedDBID | -~X .4S .DC 123 186 4.4 7WY 7X2 7XC 88I 8CJ 8FE 8FG 8FH 8FL 8G5 8V8 AALVN AASXH AAYXX ABDBF ABDPE ABJCF ABKAD ABMZU ABUWG ACGFO ACGOD ACIWK ACPRK ACUHS ADBBV AEMOZ AENEX AFFHD AFFNX AFKRA AFRAH AHQJS AKVCP ALMA_UNASSIGNED_HOLDINGS ANXRF ARAPS ARCSS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI BPHCQ CCPQU CITATION CS3 CZ9 D0L D1I D1J D1K DQ2 DU5 DWQXO EAP EBR EBS EBU ECS EDO EJD EMK EST ESX FA8 FRNLG GNUQQ GUQSH H13 HCIFZ H~9 I-F K1G K6- K60 K6V K6~ K7- KB. KC. L6V LK5 LK8 M0C M0K M1Q M2O M2P M7P M7R M7S P1Q P2P P62 PATMY PDBOC PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PTHSS PYCSY RJG RNS RSI TH9 TN5 TUS YNT ZKB ZY4 IQODW 3V. 7XB 88A 88K 8AL 8FK JQ2 L.- M0N M2T MBDVC PKEHL PQEST PQUKI PRINS Q9U 7SC 8FD L7M L~C L~D |
| ID | FETCH-LOGICAL-c318t-48bf934a43fd1c9c044dbc219c1b9a6cea08615e6401b3ef10764c660f6a6b23 |
| IEDL.DBID | M1Q |
| ISICitedReferencesCount | 52 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000285933400033&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0895-4798 |
| IngestDate | Sun Nov 09 13:44:13 EST 2025 Sun Oct 26 18:18:45 EDT 2025 Mon Jul 21 09:12:15 EDT 2025 Sat Nov 29 02:43:41 EST 2025 Tue Nov 18 22:22:49 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Triangular matrix Compression Stabilization Schur compensation Numerical data Cholesky method Compensation 65F30 Development Sparse matrix hierarchically semiseparable structure Schur complement Approximation off-diagonal compression robust preconditioner Rank Algorithm Factorization Numerical analysis Symmetric matrix 15A12 Linear algebra Positive definite matrix Potential method Performance Preconditioning 65F05 |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c318t-48bf934a43fd1c9c044dbc219c1b9a6cea08615e6401b3ef10764c660f6a6b23 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 879784233 |
| PQPubID | 666305 |
| PageCount | 22 |
| ParticipantIDs | proquest_miscellaneous_907960164 proquest_journals_879784233 pascalfrancis_primary_23817823 crossref_citationtrail_10_1137_090750500 crossref_primary_10_1137_090750500 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-01-01 |
| PublicationDateYYYYMMDD | 2010-01-01 |
| PublicationDate_xml | – month: 01 year: 2010 text: 2010-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Philadelphia, PA |
| PublicationPlace_xml | – name: Philadelphia, PA – name: Philadelphia |
| PublicationTitle | SIAM journal on matrix analysis and applications |
| PublicationYear | 2010 |
| Publisher | Society for Industrial and Applied Mathematics |
| Publisher_xml | – name: Society for Industrial and Applied Mathematics |
| References | Meijerink J. A. (R42) 1977; 31 R41 R40 R21 R20 R23 R45 R22 R44 R25 R47 R24 R46 R27 R26 R29 Hackbusch W. (R34) 2000; 64 R1 R2 R4 R5 R6 R7 R8 R9 R30 R10 R31 R12 R11 R33 R14 R13 R35 R38 R15 R37 R18 R17 R39 R19 |
| References_xml | – volume: 31 start-page: 148 issn: 0025-5718 year: 1977 ident: R42 publication-title: Math. Comp. – ident: R25 doi: 10.1016/j.laa.2005.02.037 – ident: R4 doi: 10.1090/S0025-5718-04-01716-8 – ident: R33 doi: 10.1007/s006070050020 – ident: R2 doi: 10.1002/nla.1680010207 – ident: R20 doi: 10.1137/S0895479803436652 – ident: R41 doi: 10.1090/S0025-5718-1980-0559197-0 – volume: 64 start-page: 21 issn: 0010-485X year: 2000 ident: R34 publication-title: Computing doi: 10.1007/PL00021408 – ident: R18 doi: 10.1016/0024-3795(87)90103-0 – ident: R8 doi: 10.1002/nla.329 – ident: R24 doi: 10.1145/356044.356047 – ident: R40 doi: 10.1016/j.jcp.2004.10.033 – ident: R7 doi: 10.1137/S1064827599356900 – ident: R17 doi: 10.1007/BF01436084 – ident: R9 doi: 10.1007/s00211-005-0595-4 – ident: R29 doi: 10.1016/S0024-3795(96)00301-1 – ident: R46 doi: 10.1007/s10092-005-0107-z – ident: R19 doi: 10.1137/S0895479891223781 – ident: R22 doi: 10.1137/050636012 – ident: R44 doi: 10.1007/s006070070031 – ident: R6 doi: 10.1002/nla.525 – ident: R37 doi: 10.1002/(SICI)1099-1506(199811/12)5:6<483::AID-NLA156>3.3.CO;2-Z – ident: R11 doi: 10.1016/j.laa.2006.10.021 – ident: R21 doi: 10.1137/S0895479802405884 – ident: R35 doi: 10.1007/s00607-004-0080-4 – ident: R12 doi: 10.1137/080720693 – ident: R26 doi: 10.1016/j.laa.2007.08.038 – ident: R27 doi: 10.1137/0710032 – ident: R30 doi: 10.1007/s00791-008-0098-9 – ident: R31 doi: 10.1137/0917055 – ident: R45 doi: 10.1002/nla.461 – ident: R5 doi: 10.1007/s00211-002-0445-6 – ident: R15 doi: 10.1137/040615845 – ident: R10 doi: 10.1007/s00607-005-0146-y – ident: R13 doi: 10.1016/S0955-7997(02)00152-2 – ident: R23 doi: 10.1137/0720040 – ident: R39 doi: 10.1007/s10915-008-9240-6 – ident: R38 doi: 10.1137/07068179X – ident: R1 doi: 10.1002/nme.1620200511 – ident: R14 doi: 10.1007/s00607-002-1450-4 – ident: R47 doi: 10.1137/09074543X |
| SSID | ssj0016491 |
| Score | 2.1587586 |
| Snippet | Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A [asymptotically =] R^T R up to any desired accuracy,... Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A approximately R theta R up to any desired accuracy,... |
| SourceID | proquest pascalfrancis crossref |
| SourceType | Aggregation Database Index Database Enrichment Source |
| StartPage | 2899 |
| SubjectTerms | Algebra Algorithms Approximation Breaking down Cholesky factorization Complement Compressing Exact sciences and technology Factorization Linear and multilinear algebra, matrix theory Mathematical analysis Mathematical models Mathematics Matrix Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use Studies |
| Title | Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices |
| URI | https://www.proquest.com/docview/879784233 https://www.proquest.com/docview/907960164 |
| Volume | 31 |
| WOSCitedRecordID | wos000285933400033&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: 7WY dateStart: 19800301 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: M0C dateStart: 19800301 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1095-7162 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: P5Z dateStart: 19880101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Agriculture Science Database customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: M0K dateStart: 19800301 isFulltext: true titleUrlDefault: https://search.proquest.com/agriculturejournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: M7P dateStart: 19800301 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database ProQuest customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: K7- dateStart: 19800301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: M7S dateStart: 19800301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Environmental Science Database customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: PATMY dateStart: 19800301 isFulltext: true titleUrlDefault: http://search.proquest.com/environmentalscience providerName: ProQuest – providerCode: PRVPQU databaseName: Materials Science Database customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: KB. dateStart: 19800301 isFulltext: true titleUrlDefault: http://search.proquest.com/materialsscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Military Database customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: M1Q dateStart: 19800301 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1095-7162 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: BENPR dateStart: 19880101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Research Library customDbUrl: eissn: 1095-7162 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: M2O dateStart: 19880101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database (ProQuest) customDbUrl: eissn: 1095-7162 dateEnd: 20140731 omitProxy: false ssIdentifier: ssj0016491 issn: 0895-4798 databaseCode: M2P dateStart: 19800301 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb5wwELaapIdGVd9VtmlXVtVDL7SwgMGniCWgoi2PAkl3c0HGGClStLsNm_7-jA2LWrXqpZdPRrYM8tgzngczCH0wZ0LGtuoa10mtWU1jaLSGluuyxiCU10K5Cy6_OkniLpc0G2JzuiGscs8TFaNuNlzayD-7Dug7IPvNs-0PTRaNks7VoYLGATqCezKVqfNj49voRCBWXzDPpbY0ILlDYiFDpvShUlTa8r-2X8TR4y3rYGXavqTFH9xZiZzw6X9-7DP0ZLhrYq_fHM_RA7F-gY7jMVFr9xKxPJ1fFCX2sixPl1HslQGWzqWgWKxw6PllmkdXyoyF0xDnXrLQijK_8GWwxDkuVnEclHnk4ywtojK6DPB5EEYJsEMMU0FHULxCZRiU_hdtqLqgcTjfO81y65aaFrPMtjE45bplNTUHxsaNmjLCBQMtyLAFAc2sNkUL-iOxOCF6SxipZ-ZrdLjerMUJwrbRMuqyFiZrLJ0LykHdtgmd6Sa37badoI_7ta_4kJFcFsa4qZRmYjrVSKYJej8O3fZpOP42aPobAceR8loCNyFzgk735KqGo9pVI60mCI-9cMak44Stxeauq-AFVGVee_PPCU7Roz62QBpo3qLD3e2deIce8p-76-52ig6c76spOpoHSZbD08LRJM4_Aca6r3AxVTtY4ixVmCksJTqq7RSAmX11DzoN8Ck |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bi9QwFA7LKqiId3FcXYMo-FJsp2maPIjUmZYtnXaGtrvM-lLSNAVBZsbtrOJ_8kd60huK4ts--FZISGnz5dzzHYRe2VOla1tNQ5q0NEhVWQYv4YkxUVmUy1K16YKzhZskbL3mqwP0Y7gLo8sqB5nYCupqK3WM_C1zwd8B3W-_330xdNMonVwdOmh0qIjU92_gsTXvwjls7-vpNPDz2YnRNxUwJMB3bxBW1twmgth1ZUkuTUKqUsK5lVbJBZVKgJFvOYqC41Haqgb3iBJJqVlTQUtNcwAC_xqxmatPVeQaY86Ckq4_H-OOjlexnsfI0gxCXGtmR1-j-0X73d6JBjai7jpo_KEMWg0X3P2__s09dKe3pLHXQf8-OlCbB-hWPNLQNg-RSJcfTrMce6tVulyHsZf7WKfO_Cw6x4E3y5dp-LEN0uFlgFMviYwsT09nuhRkjrPzOPbzNJzh1TIL8_DMx3M_CBMQ9hiWggE_e4Tyq_jEx-hws92oJwg7Vi04EzUsVhFTKi4ZYw7lU9OWjlPXE_Rm2OpC9nzruu3H56L1u2y3GFExQS_HqbuOZORvk45_w8s4UxtdYOfZE3Q0oKPoBVFTjNCYIDyOggTRaSGxUdvLpoAX8JZX7uk_F3iBbpzk8aJYhEl0hG52VRQ6FPUMHe4vLtVzdF1-3X9qLo7bY4FRccVQ-wmW5j_j |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Robust+Approximate+Cholesky+Factorization+of+Rank-Structured+Symmetric+Positive+Definite+Matrices&rft.jtitle=SIAM+journal+on+matrix+analysis+and+applications&rft.au=Xia%2C+Jianlin&rft.au=Gu%2C+Ming&rft.date=2010-01-01&rft.issn=0895-4798&rft.eissn=1095-7162&rft.volume=31&rft.issue=5&rft.spage=2899&rft.epage=2920&rft_id=info:doi/10.1137%2F090750500&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_090750500 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0895-4798&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0895-4798&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0895-4798&client=summon |