Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Incubator escapee wiki:Requested articles/Mathematics
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==[[Numerical analysis]]== *[[Absorbing boundary condition]] (with redirect from *[[absorbing boundary conditions]] and mentioning *[[perfectly matched layer]]) - <!--2006-07-09T05:15:57Z--> *[[Alphacertified]] e.g. [http://arxiv.org/pdf/1011.1091.pdf] * [[Essentially non-oscillatory (ENO)]] - *[[Faure sequence]] - <!--2006-08-16T00:16:41Z--> * [[Gregory's integration formula]] See [http://books.google.com/books?id=Qs-xdYBQ_5wC&pg=PA283#v=onepage&f=false] * [[Homotopy continuation method]] for solving for roots. e.g. [http://homepages.math.uic.edu/~jan/srvart/node4.html] * [[Lentz's algorithm]] (for the evaluation of continued fractions) <!-- Sources: Numerical Receipes in C++ page 177-179 ISBN 0 521 75033 4 gives a readable-ish description of modified Lentz's method. The original paper is Lentz wj Applied Optics 15, pp 668-671. The now usual method is by Thompson IJ and Barnett AR (1986) Journal of Computational Physics, vol 64, pp 490-509. --> - * [[Orthomin(1) algorithm]] (for approximating ''Ax'' = ''b'') - *[[Peano kernel]] e.g., see page 149 of [https://books.google.com/books?id=i-IjBAAAQBAJ&printsec=frontcover&dq=peano+kernel&hl=en&sa=X&ei=zDApVeOiF9C5ogTVkoHwBQ&ved=0CCsQ6AEwAQ#v=onepage&q=peano%20kernel&f=false] *[[Primorial factorization]] - <!--2014-12-31T18:08:00Z--> *[[Watson transformation]] - <!--2007-11-26T13:19:45Z--> * [[Wexler's algorithm]] - (referenced in the alt-text of xkcd.com/69) *[[Zero stability]] (of linear multistep methods) - <!--2008-06-26T13:45:13Z-->
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)