✦ LIBER ✦

Componentwise error analysis for FFTs with applications to fast Helmholtz solvers

✍ Scribed by M. Arioli; H. Munthe-Kaas; L. Valdettaro

Book ID: 105474636
Publisher: Springer US
Year: 1996
Tongue: English
Weight: 927 KB
Volume: 12
Category: Article
ISSN: 1017-1398
DOI: 10.1007/bf02141741

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithms for two maximal distance

Fast algorithms for two maximal distance problems with applications to image analysis

✍ Martin A. Fischler 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Multigrid Techniques (1984 Guide with Ap

Multigrid Techniques (1984 Guide with Applications to Fluid Dynamics, Revised Edition) || Part I: Stages in Developing Fast Solvers

✍ Brandt, Achi; Livne, Oren E. 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics ⚖ 43 KB

Fast Discrete Polynomial Transforms with

Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

✍ Driscoll, J. R.; Healy, D. M.; Rockmore, D. N. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 526 KB

Error analysis for tidal coefficients wi

Error analysis for tidal coefficients with application to HF radar surface-current measurements

✍ R.S Lyons; A.S Frisch 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 588 KB

A gas-cooled fast reactor core model for

A gas-cooled fast reactor core model for the analysis of severe accidents, with applicability to LMFBRS

✍ Hugo P. Tschirky 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 889 KB

Block error-correcting codes for systems

Block error-correcting codes for systems with a very high BER: Theoretical analysis and application to the protection of watermarks

✍ Claude Desset; Benoı̂t Macq; Luc Vandendorpe 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

This paper addresses the problem of error-correction for extremely noisy channels (BER from 0:1 to 0:5), such as those obtained for image or video watermarking. Minimum distance arguments are used to identify a region for which no other code is as efficient as repetition codes, whatever the rate, at