Showing 201 - 220 of 2,152

201

New formulas for approximation of π and other transcendental numbers: New formulas for approximation of \(\pi\) and other transcendental numbers
Bahman Kalantari
Numerical Algorithms. 24:59-81

iteration functions Pi Rate of convergence, deg... determinants algorithms Iteration functions
Academic journal
Save to List
202

Design, analysis, and implementation of a multiprecision polynomial rootfinder
BINI, DARIO ANDREA ; FIORENTINO G.
Numerical Algorithms. 23:127-173

adaptive algorithms systems of polynomial eq... root neighborhoods Zeros of polynomials, ra... Numerical computation of... polynomial with complex...
Academic journal
Save to List
203

A new continuation Newton-like method and its deformation
Xinyuan Wu
Applied Mathematics and Computation. 112:75-78

0209 industrial biotechn... continuation Newton-like... iteration method Numerical computation of... 02 engineering and techn... 0101 mathematics
Academic journal
Save to List
204

Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions: Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
Yaroslav D. Sergeyev ; Inmaculada García ; Leocadio G. Casado
Reliable Computing. 6:179-191

Interval and finite arit... interval algorithm 0211 other engineering a... 0202 electrical engineer... selection Numerical computation of...
Academic journal
Save to List
205

The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
D.V. Vranić ; Miodrag S. Petković
Computers & Mathematics with Applications. 39:95-105

convergence Interval and finite arit... Inclusion of zeros simultaneous method interval arithmetic 01 natural sciences
Academic journal
Save to List
206

Newton's method and generation of a determinantal family of iteration functions
Jurgen Gerlach ; Bahman Kalantari
Journal of Computational and Applied Mathematics. 116:195-200

high-order method Applied Mathematics Polynomial roots root finding 01 natural sciences Real polynomials: locati...
Academic journal
Save to List
207

On the perturbation of the zeros of complex polynomials
R Schätzle
IMA Journal of Numerical Analysis. 20:185-202

complex polynomials General theory of numeri... perturbation of coeffici... Zeros of polynomials, ra... Computational aspects of... Numerical computation of...
Academic journal
Save to List
208

Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Victor Y. Pan
Journal of Complexity. 16:213-264

Statistics and Probabili... Numerical Analysis computational complexity Algebra and Number Theor... Control and Optimization Applied Mathematics
Academic journal
Save to List
209

A Fast Version of the Schur–Cohn Algorithm: A fast version of the Schur-Cohn algorithm.
Philippe Saux Picart ; Cyril Brunie
Journal of Complexity. 16:54-69

Statistics and Probabili... Numerical Analysis Algebra and Number Theor... Control and Optimization Analysis of algorithms a... Applied Mathematics
Academic journal
Save to List
210

On Symbolic-Numeric Solving of Sine-Polynomial Equations: On symbolic-numeric solving of sine-polynomial equations.
Aude Maignan
Journal of Complexity. 16:274-285

Statistics and Probabili... Numerical Analysis Algebra and Number Theor... Control and Optimization Applied Mathematics Numerical computation of...
Academic journal
Save to List
211

Lifting/Descending Processes for Polynomial Zeros: Lifting/descending processes for polynomial zeros.
Bernard Mourrain ; Victor Y. Pan
Journal of Complexity. 16:265-273

Statistics and Probabili... Numerical Analysis Complexity and performan... Algebra and Number Theor... Control and Optimization Applied Mathematics
Academic journal
Save to List
212

Robust and Efficient Ray Intersection of Implicit Surfaces: Robust and efficient ray intersection of implicit surfaces
Ole Caprani ; Thomas Schneider ; Mikkel Meng Mortensen ; et al.
Reliable Computing. 6:9-21

ray tracing Interval and finite arit... root finding 02 engineering and techn... interval arithmetic Alefeld-Hansen's method
Academic journal
Save to List
213

An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
D.M. Claudio ; Vilmar Trevisan ; M.A.O. Camargo Brunetto
Computers & Mathematics with Applications. 39:95-105

Sturm sequences complex polynomial zeros 01 natural sciences Algebraic algorithm Computational Mathematic... General theory of numeri...
Academic journal
Save to List
214

ZEAL: A mathematical software package for computing zeros of analytic functions
M. Van Barel ; Omiros Ragos ; Peter Kravanja ; et al.
Computer Physics Communications. 124:212-232

zeros of analytic functi... algorithm multiplicities isolation of zeros 02 engineering and techn... formal orthogonal polyno...
Academic journal
Save to List
215

The optimal efficiency index of a class of Hermite iterative methods with two steps
Ion Păvăloiu
Journal of Numerical Analysis and Approximation Theory, Vol 29, Iss 1 (2000)

Complexity and performan... QA1-939 optimal efficiency index Numerical computation of... Hermite iterative method... Mathematics
Academic journal
Save to List
216

NEWTON'S METHOD FOR ZERO POINTS OF A MATRIX FUNCTION AND ITS APPLICATIONS TO QUEUEING MODELS: Newton's method for zero points of a matrix function and its applications to queueing models
Atsushi Harashima ; Shoichi Nishimura
Journal of the Operations Research Society of Japan. 43:396-416

queueing models numerical results determinant 01 natural sciences spectral analysis Numerical computation of...
Academic journal
Save to List
217

Optimizations of the subresultant algorithm
Lionel Ducos
Journal of Pure and Applied Algebra. 145:149-163

Computation of special f... Algebra and Number Theor... subresultant algorithm greatest common divisor polynomials Computational aspects of...
Academic journal
Save to List
218

An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems: An efficient method for a class of continuous nonlinear knapsack problems
Aaron Melman ; Gad Rabinowitz
SIAM Review. 42:440-448

Convex programming rootfinding Halley method 0209 industrial biotechn... Numerical mathematical p... Newton method
Academic journal
Save to List
219

On a class of quadratic convergence iteration formulae without derivatives
Xinyuan Wu ; Hongwei Wu
Applied Mathematics and Computation. 107:77-80

numerical examples 0209 industrial biotechn... iterative method 0103 physical sciences Numerical computation of... 02 engineering and techn...
Academic journal
Save to List
220

THE ROOT CONDITION FOR THE THIRD ORDER POLYNOMIALS: The root condition for the third order polynomials
Štikonas, A.
Mathematical Modelling and Analysis, Vol 4, Iss 1 (1999)
Mathematical Modelling and Analysis; Vol 4 No 1 (1999); 163-173

Finite difference and fi... convergence root condition consistency finite-difference scheme... multistep methods
Academic journal
Save to List

Filter