𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Multiscale Wavelet Solver with O(n) Complexity

✍ Scribed by John R. Williams; Kevin Amaratunga

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
334 KB
Volume
122
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An example of the wavelet impedance matr
An example of the wavelet impedance matrix with O(N) nonzero elements
✍ Gaofeng Wang; Bing-Zhong Wang; Jiechang Hou πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 75 KB

By the use of wa¨elet basis functions, an integral equation can be con¨erted into a sparse matrix equation after discretization. Through the exploitation of the sparsity of the impedance matrix, the complexity of sol¨ing the resultant matrix equation can be greatly reduced. It has been reported that

A Deterministic Construction of Normal B
A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)
✍ Alain Poli πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 385 KB

Constructing normal bases of \(G F\left(q^{n}\right)\) over \(G F(q)\) can be done by probabilistic methods as well as deterministic ones. In the following paper we consider only deterministic constructions. As far as we know, the best complexity for probabilistic algorithms is \(O\left(n^{2} \log ^