| LDR | | 00000nmm u2200205 4500 |
| 001 | | 000000331863 |
| 005 | | 20241120154510 |
| 008 | | 181129s2018 ||| | | | eng d |
| 020 | |
▼a 9780438416536 |
| 035 | |
▼a (MiAaPQ)AAI10827015 |
| 035 | |
▼a (MiAaPQ)ucsb:13890 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 248032 |
| 049 | 1 |
▼f DP |
| 082 | 0 |
▼a 519 |
| 100 | 1 |
▼a Deweese, Kevin. |
| 245 | 10 |
▼a Bridging the Theory-Practice Gap of Laplacian Linear Solvers. |
| 260 | |
▼a [S.l.] :
▼b University of California, Santa Barbara.,
▼c 2018 |
| 260 | 1 |
▼a Ann Arbor :
▼b ProQuest Dissertations & Theses,
▼c 2018 |
| 300 | |
▼a 115 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 80-02(E), Section: B. |
| 500 | |
▼a Adviser: John R. Gilbert. |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of California, Santa Barbara, 2018. |
| 520 | |
▼a Solving Laplacian linear systems is an important task in a variety of practical and theoretical applications. Laplacians of structured graphs, such as two and three dimensional meshes, have long been important in finite element analysis and imag |
| 520 | |
▼a This work considers the latter possibility |
| 520 | |
▼a To challenge existing solver implementations, we propose the use of genetic algorithms to create difficult test graphs for existing solvers. At the same time, these algorithms could be used to find graphs with good performance for recently propo |
| 590 | |
▼a School code: 0035. |
| 650 | 4 |
▼a Applied mathematics. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0364 |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a University of California, Santa Barbara.
▼b Computer Science. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 80-02B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0035 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T14998967
▼n KERIS |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a 관리자
▼b 관리자 |