A fast algorithm with error bounds for quadrature by expansion (Q2312108): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcp.2018.05.006 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129477198 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCP.2018.05.006 / rank | |||
Normal rank | |||
Latest revision as of 23:08, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm with error bounds for quadrature by expansion |
scientific article |
Statements
A fast algorithm with error bounds for quadrature by expansion (English)
0 references
4 July 2019
0 references
fast algorithms
0 references
fast multipole method
0 references
integral equations
0 references
quadrature
0 references
singular integrals
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
