| 000 | 01467 a2200289 4500 | ||
|---|---|---|---|
| 001 | 113855779X | ||
| 005 | 20250317100352.0 | ||
| 008 | 250312042019xx eng | ||
| 020 | _a9781138557796 | ||
| 037 |
_bTaylor & Francis _cGBP 51.99 _fBB |
||
| 040 | _a01 | ||
| 041 | _aeng | ||
| 072 | 7 |
_aPBKJ _2thema |
|
| 072 | 7 |
_aPBW _2thema |
|
| 072 | 7 |
_aPBKJ _2bic |
|
| 072 | 7 |
_aPBW _2bic |
|
| 072 | 7 |
_aMAT007000 _2bisac |
|
| 072 | 7 |
_aMAT003000 _2bisac |
|
| 072 | 7 |
_aMAT000000 _2bisac |
|
| 072 | 7 |
_a515.53 _2bisac |
|
| 100 | 1 | _aEvgenii A. Volkov | |
| 245 | 1 | 0 | _aBlock Method for Solving the Laplace Equation and for Constructing Conformal Mappings |
| 250 | _a1 | ||
| 260 |
_bCRC Press _c20190125 |
||
| 300 | _a238 p | ||
| 520 | _bThis book presents a new, efficient numerical-analytical method for solving the Laplace equation on an arbitrary polygon. This method, called the approximate block method, overcomes indicated difficulties and has qualitatively more rapid convergence than well-known difference and variational-difference methods. The block method also solves the complicated problem of approximate conformal mapping of multiply-connected polygons onto canonical domains with no preliminary information required. The high-precision results of calculations carried out on the computer are presented in an abundance of tables substantiating the exponential convergence of the block method and its strong stability concerning the rounding-off of errors. | ||
| 999 |
_c285 _d285 |
||