This is an iterative method using the tangent line approximation. $$x_n+1 = x_n - \fracf(x_n)f'(x_n)$$
The simplest method. It steps forward using the slope at the current point. $$y_n+1 = y_n + h f(x_n, y_n)$$ It is rarely used in practice due to poor accuracy but serves as the conceptual foundation for more advanced methods.
If a new abstract looks promising but the PDF is behind a paywall, find the corresponding author's email (often on the abstract page or ResearchGate) and request an e-print. Most academics are happy to share for non-commercial research. numerical analysis titas publication pdf new
Strengths:
Weaknesses / Gaps:
Provide a concise summary stating the equation or problem studied, numerical methods used, main theoretical results (stability/convergence orders), and key computational findings (error rates, runtimes). Example: "We analyze numerical schemes for [PDE/ODE/integral equation], propose a [method name] combining [techniques], prove stability and O(h^p) convergence, and validate results on benchmark problems showing observed order p and efficient CPU performance."
Set up alerts:
Based on call-for-papers announcements and recent editorials, here are emerging themes likely to appear in “new” TITAS PDFs over the next 12–18 months:
Keep an eye on the journal’s “Forthcoming Articles” section. This is an iterative method using the tangent