|
Lentz's Algorithm
In mathematics, Lentz's algorithm is an algorithm to evaluate continued fractions and compute tables of spherical Bessel functions. The version usually employed now is due to Thompson and Barnett. History The idea was introduced in 1973 by William J. Lentz and was simplified by him in 1982. Lentz suggested that calculating ratios of spherical Bessel functions of complex arguments can be difficult. He developed a new continued fraction technique for calculating the ratios of spherical Bessel functions of consecutive order. This method was an improvement compared to other methods because it started from the beginning of the continued fraction rather than the tail, had a built-in check for convergence, and was numerically stable. The original algorithm uses algebra to bypass a zero in either the numerator or denominator. Simpler Improvements to overcome unwanted zero terms include an altered recurrence relation suggested by Jaaskelainen and Ruuskanen in 1981 or a simple shift of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can perform automated deductions (referred to as automated reasoning) and use mathematical and logical tests to divert the code execution through various routes (referred to as automated decision-making). Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus". In contrast, a Heuristic (computer science), heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. As an effective method, an algorithm ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generalized Continued Fraction
In complex analysis, a branch of mathematics, a generalized continued fraction is a generalization of regular continued fractions in canonical form, in which the partial numerators and partial denominators can assume arbitrary complex values. A generalized continued fraction is an expression of the form :x = b_0 + \cfrac where the () are the partial numerators, the are the partial denominators, and the leading term is called the ''integer'' part of the continued fraction. The successive convergents of the continued fraction are formed by applying the fundamental recurrence formulas: :\begin x_0 &= \frac = b_0, \\ pxx_1 &= \frac = \frac, \\ pxx_2 &= \frac = \frac,\ \dots \end where is the ''numerator'' and is the ''denominator'', called continuants, of the th convergent. They are given by the recursion :\begin A_n &= b_n A_ + a_n A_, \\ B_n &= b_n B_ + a_n B_ \qquad \text n \ge 1 \end with initial values :\begin A_ &= 1,& A_0&=b_0,\\ B_&=0, & B_0&=1. \end If the sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bessel Function
Bessel functions, first defined by the mathematician Daniel Bernoulli and then generalized by Friedrich Bessel, are canonical solutions of Bessel's differential equation x^2 \frac + x \frac + \left(x^2 - \alpha^2 \right)y = 0 for an arbitrary complex number \alpha, the ''order'' of the Bessel function. Although \alpha and -\alpha produce the same differential equation, it is conventional to define different Bessel functions for these two values in such a way that the Bessel functions are mostly smooth functions of \alpha. The most important cases are when \alpha is an integer or half-integer. Bessel functions for integer \alpha are also known as cylinder functions or the cylindrical harmonics because they appear in the solution to Laplace's equation in cylindrical coordinates. Spherical Bessel functions with half-integer \alpha are obtained when the Helmholtz equation is solved in spherical coordinates. Applications of Bessel functions The Bessel function is a generalizat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mie Scattering
The Mie solution to Maxwell's equations (also known as the Lorenz–Mie solution, the Lorenz–Mie–Debye solution or Mie scattering) describes the scattering of an electromagnetic plane wave by a homogeneous sphere. The solution takes the form of an infinite series of spherical multipole partial waves. It is named after Gustav Mie. The term ''Mie solution'' is also used for solutions of Maxwell's equations for scattering by stratified spheres or by infinite cylinders, or other geometries where one can write separate equations for the radial and angular dependence of solutions. The term ''Mie theory'' is sometimes used for this collection of solutions and methods; it does not refer to an independent physical theory or law. More broadly, the "Mie scattering" formulas are most useful in situations where the size of the scattering particles is comparable to the wavelength of the light, rather than much smaller or much larger. Mie scattering (sometimes referred to as a non-mol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wallis-Euler Relations
In complex analysis, a branch of mathematics, a generalized continued fraction is a generalization of regular continued fractions in canonical form, in which the partial numerators and partial denominators can assume arbitrary complex number, complex values. A generalized continued fraction is an expression of the form :x = b_0 + \cfrac where the () are the partial numerators, the are the partial denominators, and the leading term is called the ''integer'' part of the continued fraction. The successive convergents of the continued fraction are formed by applying the fundamental recurrence formulas: :\begin x_0 &= \frac = b_0, \\[4px] x_1 &= \frac = \frac, \\[4px] x_2 &= \frac = \frac,\ \dots \end where is the ''numerator'' and is the ''denominator'', called Continuant (mathematics), continuants, of the th convergent. They are given by the recursion :\begin A_n &= b_n A_ + a_n A_, \\ B_n &= b_n B_ + a_n B_ \qquad \text n \ge 1 \end with initial values :\begin A_ &= 1,& A_0 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generalized Continued Fraction
In complex analysis, a branch of mathematics, a generalized continued fraction is a generalization of regular continued fractions in canonical form, in which the partial numerators and partial denominators can assume arbitrary complex values. A generalized continued fraction is an expression of the form :x = b_0 + \cfrac where the () are the partial numerators, the are the partial denominators, and the leading term is called the ''integer'' part of the continued fraction. The successive convergents of the continued fraction are formed by applying the fundamental recurrence formulas: :\begin x_0 &= \frac = b_0, \\ pxx_1 &= \frac = \frac, \\ pxx_2 &= \frac = \frac,\ \dots \end where is the ''numerator'' and is the ''denominator'', called continuants, of the th convergent. They are given by the recursion :\begin A_n &= b_n A_ + a_n A_, \\ B_n &= b_n B_ + a_n B_ \qquad \text n \ge 1 \end with initial values :\begin A_ &= 1,& A_0&=b_0,\\ B_&=0, & B_0&=1. \end If the sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
