Newton-Like Algorithms for KTH Root Calculation

Annales Polonici Mathematici - Poland
doi 10.4064/ap-52-3-303-312
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Institute of Mathematics, Polish Academy of Sciences

Related search

Root-Loci Concepts for KTH-Order-Type Multivariable Structures

Proceedings of the Institution of Electrical Engineers
MedicineEngineering
1976English

Pruning Algorithms for Pretropisms of Newton Polytopes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Comparing Genetic Algorithms and Newton-Like Methods for the Solution of the History Matching Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Field-Split Preconditioned Inexact Newton Algorithms

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2015English

Coefficient Functional for the KTH Root Transform of Analytic Function and Applications to Fractional Derivatives

Fractional Differential Calculus
2018English

Low Complexity Secant Quasi-Newton Minimization Algorithms for Nonconvex Functions

Journal of Computational and Applied Mathematics
Computational MathematicsApplied Mathematics
2007English

Eigendecomposition Algorithms Solving Sequentially Quadratic Systems by Newton Method

JSIAM Letters
2009English

Accelerating Relaxation Algorithms for Circuit Simulation Using Waveform-Newton and Step-Size Refinement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
1990English

Monotone Convergence of Newton-Like Methods for M-Matrix Algebraic Riccati Equations

Numerical Algorithms
Applied Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy