Výsledky vyhľadávania - "Root-finding algorithm"

Connected McMullen-Like Julia Sets in a Chebyshev–Halley Family

Autori: Canela, Jordi Garijo, Antonio Roesch, Pascale a ďalší

Prispievatelia: Canela, Jordi Garijo, Antonio Roesch, Pascale a ďalší

Zdroj: Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona

Predmety: Julia sets, [MATH] Mathematics [math], Dynamical Systems (math.DS), Singular perturbations, 01 natural sciences, 37F10, 37F31, 37F44, Degeneracy parameters, Root-finding algorithm, 0103 physical sciences, FOS: Mathematics, Holomorphic dynamics, [MATH]Mathematics [math], Mathematics - Dynamical Systems, 0101 mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2401.12374
https://ddd.uab.cat/record/313605
https://hal.science/hal-04860946v1/document
https://hal.science/hal-04860946v1

Iterative Root-Finding Algorithm for Accurate Parameter Extraction of Solar Photovoltaic Cells

Autori: Moulay Rachid Douırı

Zdroj: Volume: 37, Issue: 41770-1789
Gazi University Journal of Science

Predmety: Photovoltaic Devices (Solar Cells), Parameters extraction, Root-finding algorithm, Single diode model, Solar cells, Elektrik Enerjisi Üretimi (Yenilenebilir Kaynaklar Dahil, Fotovoltaikler Hariç), Fotovoltaik Cihazlar (Güneş Pilleri), Electrical Energy Generation (Incl. Renewables, Excl. Photovoltaics), Photovoltaic Power Systems, Fotovoltaik Güç Sistemleri

Popis súboru: application/pdf

Prístupová URL adresa: https://dergipark.org.tr/tr/pub/gujs/issue/88163/1374222

A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography

Autori: Sania Qureshi Ioannis K. Argyros Amanullah Soomro a ďalší

Zdroj: Numerical Algorithms. 95:1715-1745

Predmety: Composite material, Convex Optimization, Evolutionary biology, 02 engineering and technology, 01 natural sciences, Polynomial, Mathematical analysis, Quantum mechanics, Convergence Analysis of Iterative Methods for Nonlinear Equations, Higher-Order Methods, Range (aeronautics), 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Root (linguistics), 0101 mathematics, Floating-Point Arithmetic in Scientific Computation, Biology, Theory of computation, Numerical Analysis, Numerical Optimization Techniques, Semidefinite Programming, Physics, 4. Education, Mathematical optimization, Linguistics, Computer science, Iterative method, Materials science, FOS: Philosophy, ethics and religion, Algorithm, Philosophy, Iterative refinement, Computational Theory and Mathematics, Root-finding algorithm, Function (biology), Physical Sciences, Computer Science, Derivative-Free Optimization, Nonlinear system, FOS: Languages and literature, Iterative Methods, Mathematics

Graphical and Numerical Study of a Newly Developed Root-Finding Algorithm and Its Engineering Applications

Autori: Amir Naseem M. A. Rehman Sania Qureshi a ďalší

Zdroj: IEEE Access, Vol 11, Pp 2375-2383 (2023)

Predmety: 0209 industrial biotechnology, Halley's scheme, Economics, Quintic function, Computational Mechanics, 02 engineering and technology, non-linearity, Quantum mechanics, convergence-order, Convergence Analysis of Iterative Methods for Nonlinear Equations, Higher-Order Methods, Engineering, FOS: Mathematics, Root (linguistics), 0202 electrical engineering, electronic engineering, information engineering, Isogeometric Analysis in Computational Engineering, Floating-Point Arithmetic in Scientific Computation, Economic growth, Accuracy-Guaranteed Bit-Width Optimization, Numerical Analysis, Computer network, Physics, Mathematical optimization, Linguistics, Derivative-Free Methods, Rate of convergence, dynamical aspects, Computer science, TK1-9971, FOS: Philosophy, ethics and religion, Computational algorithms, Algorithm, Philosophy, Computational Theory and Mathematics, Root-finding algorithm, Channel (broadcasting), Physical Sciences, Computer Science, Convergence (economics), FOS: Languages and literature, Nonlinear system, Electrical engineering. Electronics. Nuclear engineering, Iterative Methods, Mathematics

Prístupová URL adresa: https://doaj.org/article/34c21ddc15c3400aade1e358a540391f

Equation solving iterations based on tangential convex functions

Autori: Várterész, Magdolna

Zdroj: Publicationes Mathematicae Debrecen. 39:253-261

Predmety: global convergence, Newton's method, Interval and finite arithmetic, method of tangential parabolas, Numerical computation of solutions to single equations, root-finding algorithm, interval arithmetic, 0101 mathematics, convergence order, methods of tangential convex functions, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/61522

A Novel Root-Finding Algorithm With Engineering Applications and its Dynamics via Computer Technology

Autori: Amir Naseem M. A. Rehman Thabet Abdeljawad

Zdroj: IEEE Access, Vol 10, Pp 19677-19684 (2022)

Predmety: 0209 industrial biotechnology, Economics, Computational Mechanics, High-Precision Computation, 02 engineering and technology, Structural Analysis, Quantum mechanics, non-linear equations, Convergence Analysis of Iterative Methods for Nonlinear Equations, Higher-Order Methods, Engineering, Computer security, Househölder's method, polynomiography, FOS: Mathematics, Root (linguistics), 0202 electrical engineering, electronic engineering, information engineering, Isogeometric Analysis in Computational Engineering, Floating-Point Arithmetic in Scientific Computation, Key (lock), Economic growth, Quartic function, Numerical Analysis, Physics, Mathematical optimization, Traub's method, Pure mathematics, Linguistics, Derivative-Free Methods, Rate of convergence, Computer science, Iterative method, TK1-9971, FOS: Philosophy, ethics and religion, Algorithm, Philosophy, Computational Theory and Mathematics, Root-finding algorithm, Order of convergence, Physical Sciences, Computer Science, Convergence (economics), Nonlinear system, FOS: Languages and literature, Electrical engineering. Electronics. Nuclear engineering, Correctness, Iterative Methods, Mathematics

Prístupová URL adresa: https://ieeexplore.ieee.org/ielx7/6287639/6514899/09709846.pdf
https://doaj.org/article/9d76e6ffb0214913b245401faba2d498

Global Complex Roots and Poles Finding Algorithm in C × R Domain

Autori: Sebastian Dziedziewicz Malgorzata Warecka Rafal Lech a ďalší

Zdroj: IEEE Access, Vol 11, Pp 68809-68817 (2023)

Predmety: Complex zeros and poles, numerical computations, root finding algorithm, roots of complex equation, resonators, waveguide structures, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

Popis súboru: electronic resource

Relation: https://ieeexplore.ieee.org/document/10174624/; https://doaj.org/toc/2169-3536

Prístupová URL adresa: https://doaj.org/article/4a09ff41bf9f418a9f7b2b304eae14ef

Robust Calculation of the Modes in Parabolic Cylinder Metallic Waveguides by Means of a Root-Finding Method For Bivariate Functions

Autori: Morán López, Ana Córcoles Ortega, Juan Ruiz Cruz, Jorge Alfonso a ďalší

Prispievatelia: Morán López, Ana Córcoles Ortega, Juan Ruiz Cruz, Jorge Alfonso a ďalší

Predmety: bivariate root-finding algorithm, Helmholtz equation, modal solutions, parabolic cylinder waveguide, separation of variables, Weber functions, Telecomunicaciones

Popis súboru: application/pdf

Relation: IEEE Transactions on Microwave Theory and Techniques; https://doi.org/10.1109/TMTT.2017.2777969; Gobierno de España. TEC2016-76070-C3-1/2-R; Comunidad de Madrid. S2013/ICE-3000; http://hdl.handle.net/10486/710999; 623; 632; 66

Dostupnosť: http://hdl.handle.net/10486/710999
https://doi.org/10.1109/TMTT.2017.2777969

The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable

Autori: Graça, Daniel Zhong, Ning Sapientia

Prispievatelia: Graça, Daniel Zhong, Ning Sapientia

Zdroj: Theoretical Computer Science

Predmety: FOS: Computer and information sciences, Computability, Global root-finding algorithm, 03D78 (Primary) 37C20, 37C25, 26B10 (Secondary), Mathematics - Logic, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Hyperbolic equilibria, Computing the number of zeros of a function, Computer Science - Computational Complexity, FOS: Mathematics, 0101 mathematics, Logic (math.LO)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/2002.08199
http://arxiv.org/abs/2002.08199
https://www.sciencedirect.com/science/article/pii/S0304397521005600
https://arxiv.org/abs/2002.08199
https://arxiv.org/pdf/2002.08199
https://ui.adsabs.harvard.edu/abs/2020arXiv200208199G/abstract
https://dblp.uni-trier.de/db/journals/corr/corr2002.html#abs-2002-08199
https://hdl.handle.net/10400.1/17359

A dynamical interval Newton method

Autori: Menini L. Possieri C. Tornambe A. a ďalší

Prispievatelia: Menini L. Possieri C. Tornambe A. a ďalší

Zdroj: European journal of control (2020). doi:10.1016/j.ejcon.2020.10.004
info:cnr-pdr/source/autori:Menini, Laura; Possieri, Corrado; Tornambe, Antonio/titolo:A dynamical interval Newton method/doi:10.1016%2Fj.ejcon.2020.10.004/rivista:European journal of control/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume

Predmety: 0209 industrial biotechnology, Observer design, Robotic manipulators, 02 engineering and technology, Settore ING-INF/04 - AUTOMATICA, 0101 mathematics, 01 natural sciences, Settore IINF-04/A - Automatica, Interval estimation, Polynomial methods, Root finding algorithm

Popis súboru: application/pdf

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0947358020305355
https://dblp.uni-trier.de/db/journals/ejcon/ejcon59.html#MeniniPT21
https://hdl.handle.net/20.500.14243/388766
https://doi.org/10.1016/j.ejcon.2020.10.004
http://www.sciencedirect.com/science/article/pii/S0947358020305355
https://hdl.handle.net/2108/273810
https://doi.org/10.1016/j.ejcon.2020.10.004

Quadratic Convergence Iterative Algorithms of Taylor Series for Solving Non-linear Equations

Autori: Umair Khalid Qureshi Zubair Ahmed Kalhoro Rajab A. Malookani a ďalší

Zdroj: Quaid-e-Awam University Research Journal of Engineering, Science & Technology. 18:150-156

Predmety: 0209 industrial biotechnology, Quadratic Programming, Economics, Quadrature Formulas, Geometry, 02 engineering and technology, Mathematical analysis, Quantum mechanics, 01 natural sciences, Convergence Analysis of Iterative Methods for Nonlinear Equations, Computer security, Newton's method in optimization, Field (mathematics), FOS: Mathematics, Taylor series, Series (stratigraphy), 0101 mathematics, Local convergence, Key (lock), Biology, Economic growth, Numerical Analysis, Numerical Optimization Techniques, Physics, 4. Education, Pure mathematics, Quadratic equation, Paleontology, Rate of convergence, Applied mathematics, Computer science, Convergence Analysis, Iterative method, Algorithm, Transcendental equation, Newton's method, Root-finding algorithm, Physical Sciences, Convergence (economics), Nonlinear system, Iterated function, Iterative Methods, Mathematics, Mixed-Integer Nonlinear Programs, Numerical analysis

Prístupová URL adresa: http://publications.quest.edu.pk/ojs-3.1.1-4/index.php/qrj/article/download/205/84

Self‐triggered stabilizing controllers for linear continuous‐time systems

Autori: Zobiri, Fairouz Meslem, Nacim Bidegaray-Fesquet, Brigitte a ďalší

Prispievatelia: Zobiri, Fairouz Meslem, Nacim Bidegaray-Fesquet, Brigitte a ďalší

Zdroj: International Journal of Robust and Nonlinear Control. 30:6502-6517

Predmety: Technology, 0209 industrial biotechnology, Mathematics, Applied, Systems and Control (eess.SY), 02 engineering and technology, Self-triggered control, Electrical Engineering and Systems Science - Systems and Control, [SPI.AUTO]Engineering Sciences [physics]/Automatic, [SPI]Engineering Sciences [physics], Automation & Control Systems, Engineering, 0102 Applied Mathematics, FOS: Electrical engineering, electronic engineering, information engineering, 4901 Applied mathematics, Lyapunov function, Science & Technology, Engineering, Electrical & Electronic, root-finding algorithm, 0906 Electrical and Electronic Engineering, Industrial Engineering & Automation, self-triggered control, 4009 Electronics, sensors and digital hardware, Physical Sciences, Mathematics, 0913 Mechanical Engineering

Prístupová URL adresa: http://arxiv.org/pdf/1907.01861
http://arxiv.org/abs/1907.01861
https://hal.archives-ouvertes.fr/hal-02171976/document
https://hal.archives-ouvertes.fr/hal-02171976
https://arxiv.org/abs/1907.01861
https://arxiv.org/pdf/1907.01861.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-01861
https://onlinelibrary.wiley.com/doi/10.1002/rnc.5123
https://lirias.kuleuven.be/handle/20.500.12942/704638
https://doi.org/10.1002/rnc.5123

Fast Computation of the Roots of Polynomials Over the Ring of Power Series

Autori: Neiger, Vincent Rosenkilde, Johan Schost, Éric

Zdroj: Neiger, V, Rosenkilde, J & Schost, É 2017, Fast computation of the roots of polynomials over the ring of power series . in ISSAC 2017-Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation . vol. Part F129312, Association for Computing Machinery, pp. 349-356, 42nd ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, 25/07/2017 . https://doi.org/10.1145/3087604.3087642

Predmety: Computer Science - Symbolic Computation, FOS: Computer and information sciences, Polynomial root-finding algorithm, 0202 electrical engineering, electronic engineering, information engineering, Power series, 0102 computer and information sciences, 02 engineering and technology, Symbolic Computation (cs.SC), List decoding, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://backend.orbit.dtu.dk/ws/files/140635954/2017_issac_fxrootfinding.pdf
http://arxiv.org/abs/1705.10658
https://hal.inria.fr/hal-01457954
https://dl.acm.org/doi/10.1145/3087604.3087642
https://hal.inria.fr/hal-01457954/document
https://dblp.uni-trier.de/db/journals/corr/corr1705.html#NeigerRS17
https://arxiv.org/abs/1705.10658
https://arxiv.org/pdf/1705.10658.pdf
https://ui.adsabs.harvard.edu/abs/2017arXiv170510658N/abstract
https://arxiv.org/abs/1705.10658
https://orbit.dtu.dk/en/publications/de5fc0d2-51af-4346-8fe4-e931c505f6d0

Solving polynomial eigenvalue problems by means of the Ehrlich–Aberth method

Autori: BINI, DARIO ANDREA NOFERINI, VANNI

Zdroj: Linear Algebra and its Applications. 439:1130-1149

Predmety: FOS: Mathematics, Polynomial eigenvalue problem, Root-finding algorithm, Ehrlich–Aberth method, Structured polynomials, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), 0101 mathematics, 01 natural sciences

Prístupová URL adresa: http://arxiv.org/abs/1207.6292
https://www.sciencedirect.com/science/article/pii/S0024379513001559#!
https://core.ac.uk/display/80245165
https://www.sciencedirect.com/science/article/pii/S0024379513001559
https://research.aalto.fi/en/publications/solving-polynomial-eigenvalue-problems-by-means-of-the-ehrlich-ab
https://hdl.handle.net/11568/217543
https://doi.org/10.1016/j.laa.2013.02.024

The Padé iterations for the matrix sign function and their reciprocals are optimal

Autori: GRECO, FEDERICO IANNAZZO, Bruno Poloni, Federico

Zdroj: Linear Algebra and its Applications. 436:472-477

Predmety: Rational iterations, Matrix functions, Matrix sign function, Local convergence, Padé approximation, Root-finding algorithm, Numerical Analysis, Algebra and Number Theory, Numerical Analysis (math.NA), 01 natural sciences, FOS: Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematics - Numerical Analysis, 0101 mathematics, Padé approximation

Prístupová URL adresa: http://arxiv.org/abs/1011.1725

Second-order complex Newton root-finding algorithm for determining resonant modes of a nontrivial laser system

Autori: D. R. Klemer S. Connell Mohammad A. Karim

Zdroj: Mathematical and Computer Modelling. 19:21-28

Predmety: numerical examples, complex Newton root-finding algorithm, iterative root-finding algorithm, Lasers, masers, optical bistability, nonlinear optics, second-order algorithm, 02 engineering and technology, Taylor series expansion, 01 natural sciences, Computer Science Applications, General theory of numerical methods in complex analysis (potential theory, etc.), error estimation, Modelling and Simulation, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Numerical computation of solutions to single equations, resonant modes of a nontrivial laser system

Popis súboru: application/xml

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0895717794900469
https://www.sciencedirect.com/science/article/abs/pii/0895717794900469

A high-order iterative formula for simultaneous determination of zeros of a polynomial

Autori: Tatsuo Torii Tetsuya Sakurai Hiroshi Sugiura

Zdroj: Journal of Computational and Applied Mathematics. 38:387-397

Predmety: simultaneous iterative method, high-order iterative formula, multiple roots, Applied Mathematics, numerical results, algorithms, single-root method, Computational Mathematics, zeros of a complex polynomial, polynomial equation, Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral), root finding algorithm, Numerical computation of solutions to single equations, high convergence order, Padé approximation, Root finding algorithm

Popis súboru: application/xml

Prístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/037704279190184L
https://www.sciencedirect.com/science/article/pii/037704279190184L

Simple and fast numerical analysis of multilayer waveguide modes

Autori: Kwon, MS Shin, SY Shin, Sang Yung

Zdroj: Optics Communications. 233:119-126

Predmety: Multilayer waveguide, 0103 physical sciences, Complex root-finding algorithm, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Propagation, 01 natural sciences

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0030401804000616
https://koasas.kaist.ac.kr/handle/10203/82920
https://ui.adsabs.harvard.edu/abs/2004OptCo.233..119K/abstract

On representations of algebraic-geometry codes

Autori: Madhu Sudan Venkatesan Guruswami

Zdroj: IEEE Transactions on Information Theory. 47:1610-1613

Predmety: Decoding, algebraic-geometric codes, 0202 electrical engineering, electronic engineering, information engineering, polynomial time algorithm, algebraic function fields, root-finding algorithm, 0102 computer and information sciences, 02 engineering and technology, succinct representation, list decoding algorithms, 01 natural sciences, Geometric methods (including applications of algebraic geometry) applied to coding theory

Popis súboru: application/xml

Prístupová URL adresa: http://people.csail.mit.edu/madhu/papers/2000/root-find-journ.pdf
https://ieeexplore.ieee.org/document/923745/
http://dblp.uni-trier.de/db/journals/tit/tit47.html#GuruswamiS01
https://dblp.uni-trier.de/db/journals/tit/tit47.html#GuruswamiS01

Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes

Autori: Paul H. Siegel Xin-Wen Wu

Zdroj: IEEE Transactions on Information Theory. 47:2579-2587

Predmety: Communications Technologies, Artificial Intelligence and Image Processing, Decoding, 05 social sciences, Applications to coding theory and cryptography of arithmetic geometry, Coding and Information Theory, root-finding algorithm, 02 engineering and technology, function fields, 0508 media and communications, algebraic-geometric codes, 0202 electrical engineering, electronic engineering, information engineering, Numerical computation of solutions to single equations, Electrical and Electronic Engineering, list decoding, Geometric methods (including applications of algebraic geometry) applied to coding theory

Popis súboru: application/xml; application/pdf

Prístupová URL adresa: https://research-repository.griffith.edu.au/bitstream/10072/55895/1/72705_1.pdf
https://ieeexplore.ieee.org/document/945273/
http://www.site.uottawa.ca/~zhcheng/efficient_root.pdf
https://core.ac.uk/display/21874315
https://research-repository.griffith.edu.au/handle/10072/55895
http://dblp.uni-trier.de/db/journals/tit/tit47.html#WuS01
https://dblp.uni-trier.de/db/journals/tit/tit47.html#WuS01