tangent method
1Tangent lines to circles — In Euclidean plane geometry, tangent lines to circles form the subject of several theorems, and play an important role in many geometrical constructions and proofs. Since the tangent line to a circle at a point P is perpendicular to the radius to …
2Tangent — For the tangent function see trigonometric functions. For other uses, see tangent (disambiguation). In geometry, the tangent line (or simply the tangent) to a curve at a given point is the straight line that just touches the curve at that point… …
3Method of normals — In calculus, the method of normals was a technique invented by Descartes for finding normal and tangent lines to curves. It represented one of the earliest methods for constructing tangents to curves. The method hinges on the observation that the …
4Method of characteristics — In mathematics, the method of characteristics is a technique for solving partial differential equations. Typically, it applies to first order equations, although more generally the method of characteristics is valid for any hyperbolic partial… …
5Tangent modulus — In solid mechanics, the tangent modulus is the slope of the compression stress strain curve at any specified stress or strain. Below the proportional limit the tangent modulus is equivalent to Young s modulus. Above the proportional limit the… …
6Tangent stiffness matrix — In computational mechanics, a tangent stiffness matrix is a matrix that describes the stiffness of a system in response to small changes in configuration. It represents tangent in that the energy of the system can be thought of as a high… …
7Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… …
8Euler method — In mathematics and computational science, the Euler method, named after Leonhard Euler, is a first order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. It is the most basic kind of explicit… …
9Graeffe's method — In mathematics, Graeffe s method or Dandelin–Graeffe method is an algorithm for finding all of the roots of a polynomial. It was developed independently by Germinal Pierre Dandelin in 1826 and Karl Heinrich Gräffe in 1837. Lobachevsky in 1834… …
10Midpoint method — For the midpoint rule in numerical quadrature, see rectangle method. Illustration of the midpoint method assuming that yn equals the exact value y(tn). The midpoint method computes yn + 1 …
