Chromatic roots of a ring of four cliques.
Displaying 121 – 140 of 504
Circular Arithmetic and the Determination of Polynomial Zeros.
I. Gargantini, P. Henrici (1971/1972)
Numerische Mathematik
Combination trading with limit orders.
Schellhorn, Henry (1997)
Journal of Applied Mathematics and Decision Sciences
Comparison of Brown's and Newton's Method in the Monotone Case.
Andreas Froomer (1987/1988)
Numerische Mathematik
Comparison of nonlinear solvers for the solution of radiation transport equations.
Stals, Linda (2003)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Complexity bound of absolute factoring of parametric polynomials.
Ayad, A. (2004)
Zapiski Nauchnykh Seminarov POMI
Componentwise Inclusion and Exclusion Sets for Solutions of Quadratic Equations in Finite Dimensional Spaces.
G. Alefeld (1986)
Numerische Mathematik
Comportement semi-classique du spectre des hamiltoniens quantiques hypoelliptiques
B. Helffer, D. Robert (1982)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Computation of the Smallest Positive Eigenvalue of a Quadratic ..-matrix.
Rainer Garus, Tassilo Küpper (1990)
Numerische Mathematik
Computational complexity. On the geometry of polynomials and a theory of cost. I
Mike Shub, Steve Smale (1985)
Annales scientifiques de l'École Normale Supérieure
Computing amoebas.
Theobald, Thorsten (2002)
Experimental Mathematics
Computing quaternionic roots by Newton's method.
Janovská, Drahoslava, Opfer, Gerhard (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Computing singular solutions to nonlinear analytic systems.
A.P. Morgan, A.J. Sommese, ... (1990/1991)
Numerische Mathematik
Concerning the rate of convergence of Newton's process
Vlastimil Pták (1975)
Commentationes Mathematicae Universitatis Carolinae
Conditions de positivité dans une variété symplectique complexe. Applications à l'étude de l'hypoellipticité analytique
Pierre Schapira (1979)
Journées équations aux dérivées partielles
Conditions suffisantes de sous-ellipticité pour (d’après J. J. Kohn)
M. Derridj (1977/1978)
Séminaire Équations aux dérivées partielles (Polytechnique)
Congruence of analytic functions modulo a polynomial
Zdeněk Vostrý (1977)
Kybernetika
Consistent Approximations in Newton-Type Decomposition Methods.
J.W. Schmidt, W. Hoyer, Ch. Haufe (1985)
Numerische Mathematik
Construction de paramétrixes pour des opérateurs pseudodifférentiels caractéristiques sur la réunion de deux cônes lissés
Bernard Helffer (1977)
Mémoires de la Société Mathématique de France
Continuation of invariant subspaces via the Recursive Projection Method
Vladimír Janovský, O. Liberda (2003)
Applications of Mathematics
The Recursive Projection Method is a technique for continuation of both the steady states and the dominant invariant subspaces. In this paper a modified version of the RPM called projected RPM is proposed. The modification underlines the stabilization effect. In order to improve the poor update of the unstable invariant subspace we have applied subspace iterations preconditioned by Cayley transform. A statement concerning the local convergence of the resulting method is proved. Results of numerical...