{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T18:16:15Z","timestamp":1790878575654,"version":"4.1.0"},"reference-count":31,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2005,1]]},"abstract":"\n Vandermonde, Cauchy, and Cauchy--Vandermonde totally positive linear systems can be solved extremely accurately in O(n\n 2<\/jats:sup>\n time using Bj\u00f6rck--Pereyra-type methods. We prove that Bj\u00f6rck--Pereyra-type methods exist not only for the above linear systems but also for any totally positive linear system as long as the initial minors (i.e., contiguous minors that include the first row or column) can be computed accurately. Using this result we design a new O(n\n 2<\/jats:sup>\n Bj\u00f6rck--Pereyra-type method for solving generalized Vandermonde systems of equations by using a new algorithm for computing the Schur function. We present explicit formulas for the entries of the bidiagonal decomposition, the LDU decomposition, and the inverse of a totally positive generalized Vandermonde matrix, as well as algorithms for computing these entries to high relative accuracy.\n <\/jats:p>","DOI":"10.1137\/s0895479804440335","type":"journal-article","created":{"date-parts":[[2005,8,9]],"date-time":"2005-08-09T16:06:43Z","timestamp":1123603603000},"page":"142-152","source":"Crossref","is-referenced-by-count":138,"title":["The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System"],"prefix":"10.1137","volume":"27","author":[{"given":"James","family":"Demmel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Plamen","family":"Koev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9274(96)00051-7"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1996.0057"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1970-0290541-1"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(99)00115-9"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01399609"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446"},{"key":"R7","unstructured":"J. Demmel and P. Koev,\n Accurate and efficient evaluation of Schur and Jack functions\n , Math. Comp., to appear."},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2001.11919801"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00295-7"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/BF03024444"},{"key":"R11","unstructured":"F. Gantmacher,\n The Theory of Matrices\n , AMS Chelsea Publishing, Providence, RI, 1998."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1090\/chel\/345"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90226-Z"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0168-9274(93)90093-7"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)90183-X"},{"key":"R16","unstructured":"M. Gasca, J. Pe\u00f1a, On factorizations of totally positive matrices, Math. Appl., Vol. 359, Kluwer Acad. Publ., Dordrecht, 1996, 109\u201313097h:15008"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01408579"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/0611002"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1145\/366349.366444"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1145\/366349.366444"},{"key":"R20","unstructured":"P. Koev, http:\/\/www\u2010math.mit.edu\/\u02dcplamen."},{"key":"R21","unstructured":"P. Koev,\n Accurate and Efficient Computations with Structured Matrices\n , Ph.D. dissertation, University of California, Berkeley, CA, 2002."},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479803438225"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198534891.001.0001"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(98)10073-3"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9274(97)00102-5"},{"key":"R26","unstructured":"MATLAB Reference Guide\n , The MathWorks, Inc., Natick, MA, 1992."},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386090"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(00)00124-5"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(77)90035-0"},{"key":"R30","unstructured":"S. Wolfram,\n Mathematica: A System for Doing Mathematics by Computer\n , Addison\u2010Wesley, Redwood City, CA, 1988."}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895479804440335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:23:05Z","timestamp":1787332985000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0895479804440335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1137\/S0895479804440335"],"URL":"https:\/\/doi.org\/10.1137\/s0895479804440335","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}