
One of the simplest schemes of the degenerate matrix method with nodes as zeroes of Chebyshev polynomials of the second kind is considered. Performance of simple iterations and some modifications of Newton method for the discrete problem is compared.
-, Nonlinear ordinary differential equations and systems, iterations, Numerical methods for initial value problems involving ordinary differential equations, degenerate matrix method, Newton method, QA1-939, nonlinear systems, Chebyshev polynomials, initial value problem, Mathematics, performance
-, Nonlinear ordinary differential equations and systems, iterations, Numerical methods for initial value problems involving ordinary differential equations, degenerate matrix method, Newton method, QA1-939, nonlinear systems, Chebyshev polynomials, initial value problem, Mathematics, performance
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
