| |
Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Roots Of Nonlinear Equations (G.1.5) > Iterative Methods (G.1.5...)
|
|
 |
|
|
| |
|
|
| |
1-9 of 9
Reviews about "Iterative Methods (G.1.5...)":
|
Date Reviewed |
| |
 The stochastic root-finding problem: overview, solutions, and open questions
Pasupathy R., Kim S. ACM Transactions on Modeling and Computer Simulation 21(3): 1-23, 2011. Type: Article, Reviews: (2 of 2)
This paper describes the general stochastic approximation problem: find the solutions of the nonlinear equations g(x)=0, x ∈ D, where the function
|
Nov 2 2011 |
| |
The stochastic root-finding problem: overview, solutions, and open questions
Pasupathy R., Kim S. ACM Transactions on Modeling and Computer Simulation 21(3): 1-23, 2011. Type: Article, Reviews: (1 of 2)
Both application- and theory-oriented scientists are familiar with the root-finding problem. The scientific literature is not only rich in original proposals and tutorials, but also in excellent books--Pasupathy and Kim mentio...
|
May 27 2011 |
| |
Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem
Pasupathy R., Schmeiser B. ACM Transactions on Modeling and Computer Simulation 19(2): 1-36, 2009. Type: Article
Simulation is a common technique that is used for solving many multidimensional practical problems. In this paper, simulation is used to solve the stochastic root finding problem. Pasupathy and Schmeiser propose a class of retrospectiv...
|
Jul 6 2009 |
| |
Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems
Rump S. Computing 57(1): 77-84, 1996. Type: Article
Interval arithmetic is used to obtain validated solutions to systems of nonlinear equations. An iterative process is described and then is improved in both the dense and the sparse system cases....
|
Mar 1 1997 |
| |
A projection method for computing turning points of nonlinear equations
Moret I. Computing 48(2): 133-147, 1992. Type: Article
A fashionable, and increasingly useful, subject for research in recent years has been the determination of singular points at which the solution of a nonlinear equation fails to depend smoothly on a parameter. Turning points are the si...
|
Jun 1 1993 |
| |
A class of componentwise Krawczyk-Moore type iteration methods
Zuhe S. Computing 41(1-2): 149-152, 1989. Type: Article
This short paper is devoted to the task of solving systems of nonlinear equations. In particular, the author constructs an interval containing the solution vector, that is, each component of the solution is bracketed. For this purpose,...
|
May 1 1990 |
| |
Splitting iteration method for simple singular points and simple bifurcation points
Zhen M. Computing 41(1-2): 87-96, 1989. Type: Article
The author takes the problems of finding simple singular and bifurcation points of smooth nonlinear equations, recasts them as regular augmented systems of equations, and proposes a block Jacobi/Newton iteration for their solution. Zhe...
|
Oct 1 1989 |
| |
On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
Milovanovic G., Petkovic M. ACM Transactions on Mathematical Software 12(4): 295-306, 1986. Type: Article
The authors examine the computational efficiency of several computational algorithms for finding the zeros of polynomials. Factors that go into their evaluation are the rapidity of convergence of the algorithm and the number of basic o...
|
Jul 1 1987 |
| |
Computational implementation of the multivariate Halley method for solving nonlinear systems of equations
Cuyt A., Rall L. ACM Transactions on Mathematical Software 11(1): 20-36, 1985. Type: Article
There are several extensions of Newton’s method for univariate zero-finding problems which involve the use of second, as well as first, derivative information. Some of them have analogues for multivariate zero-finding problem...
|
Aug 1 1985 |
| |
|
|
| |
|
|
