Cargando…
Fast Compact Algorithms and Software for Spline Smoothing
Fast Compact Algorithms and Software for Spline Smoothing investigates algorithmic alternatives for computing cubic smoothing splines when the amount of smoothing is determined automatically by minimizing the generalized cross-validation score. These algorithms are based on Cholesky factorization, Q...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York, NY :
Springer New York : Imprint: Springer,
2013.
|
| Edición: | 1st ed. 2013. |
| Colección: | SpringerBriefs in Computer Science,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4614-5496-0 | ||
| 003 | DE-He213 | ||
| 005 | 20220114110105.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121026s2013 xxu| s |||| 0|eng d | ||
| 020 | |a 9781461454960 |9 978-1-4614-5496-0 | ||
| 024 | 7 | |a 10.1007/978-1-4614-5496-0 |2 doi | |
| 050 | 4 | |a QA276.4-.45 | |
| 072 | 7 | |a PBT |2 bicssc | |
| 072 | 7 | |a UFM |2 bicssc | |
| 072 | 7 | |a COM077000 |2 bisacsh | |
| 072 | 7 | |a PBT |2 thema | |
| 072 | 7 | |a UFM |2 thema | |
| 082 | 0 | 4 | |a 519.5 |2 23 |
| 100 | 1 | |a Weinert, Howard L. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Fast Compact Algorithms and Software for Spline Smoothing |h [electronic resource] / |c by Howard L. Weinert. |
| 250 | |a 1st ed. 2013. | ||
| 264 | 1 | |a New York, NY : |b Springer New York : |b Imprint: Springer, |c 2013. | |
| 300 | |a VIII, 45 p. 7 illus., 5 illus. in color. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a SpringerBriefs in Computer Science, |x 2191-5776 | |
| 505 | 0 | |a Introduction -- Cholesky Algorithm -- QR Algorithm -- FFT Algorithm -- Discrete Spline Smoothing. | |
| 520 | |a Fast Compact Algorithms and Software for Spline Smoothing investigates algorithmic alternatives for computing cubic smoothing splines when the amount of smoothing is determined automatically by minimizing the generalized cross-validation score. These algorithms are based on Cholesky factorization, QR factorization, or the fast Fourier transform. All algorithms are implemented in MATLAB and are compared based on speed, memory use, and accuracy. An overall best algorithm is identified, which allows very large data sets to be processed quickly on a personal computer. | ||
| 650 | 0 | |a Mathematical statistics-Data processing. | |
| 650 | 0 | |a Signal processing. | |
| 650 | 0 | |a Mathematics-Data processing. | |
| 650 | 0 | |a Engineering mathematics. | |
| 650 | 0 | |a Engineering-Data processing. | |
| 650 | 0 | |a Computer software. | |
| 650 | 1 | 4 | |a Statistics and Computing. |
| 650 | 2 | 4 | |a Signal, Speech and Image Processing . |
| 650 | 2 | 4 | |a Computational Science and Engineering. |
| 650 | 2 | 4 | |a Mathematical and Computational Engineering Applications. |
| 650 | 2 | 4 | |a Mathematical Software. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9781461454953 |
| 776 | 0 | 8 | |i Printed edition: |z 9781461454977 |
| 830 | 0 | |a SpringerBriefs in Computer Science, |x 2191-5776 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-1-4614-5496-0 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||