|
Exponential Integrator
Exponential integrators are a class of numerical methods for the solution of ordinary differential equations, specifically initial value problems. This large class of methods from numerical analysis is based on the exact integration of the linear part of the initial value problem. Because the linear part is integrated exactly, this can help to mitigate the stiffness of a differential equation. Exponential integrators can be constructed to be explicit or implicit for numerical ordinary differential equations or serve as the time integrator for numerical partial differential equations. Background Dating back to at least the 1960s, these methods were recognized by Certaine and Pope. As of late exponential integrators have become an active area of research, see Hochbruck and Ostermann (2010). Originally developed for solving stiff differential equations, the methods have been used to solve partial differential equations including hyperbolic as well as parabolic problems such ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exponential Integral
In mathematics, the exponential integral Ei is a special function on the complex plane. It is defined as one particular definite integral of the ratio between an exponential function and its argument. Definitions For real non-zero values of ''x'', the exponential integral Ei(''x'') is defined as : \operatorname(x) = -\int_^\infty \fract\,dt = \int_^x \fract\,dt. The Risch algorithm shows that Ei is not an elementary function. The definition above can be used for positive values of ''x'', but the integral has to be understood in terms of the Cauchy principal value due to the singularity of the integrand at zero. For complex values of the argument, the definition becomes ambiguous due to branch points at 0 and Instead of Ei, the following notation is used, :E_1(z) = \int_z^\infty \frac\, dt,\qquad, (z), 0. Properties Several properties of the exponential integral below, in certain cases, allow one to avoid its explicit evaluation through the definition ab ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heat Equation
In mathematics and physics (more specifically thermodynamics), the heat equation is a parabolic partial differential equation. The theory of the heat equation was first developed by Joseph Fourier in 1822 for the purpose of modeling how a quantity such as heat diffuses through a given region. Since then, the heat equation and its variants have been found to be fundamental in many parts of both pure and applied mathematics. Definition Given an open subset of and a subinterval of , one says that a function is a solution of the heat equation if : \frac = \frac + \cdots + \frac, where denotes a general point of the domain. It is typical to refer to as time and as spatial variables, even in abstract contexts where these phrases fail to have their intuitive meaning. The collection of spatial variables is often referred to simply as . For any given value of , the right-hand side of the equation is the Laplace operator, Laplacian of the function . As such, the heat equation is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Visual Computing
Visual computing is a generic term for all computer science disciplines dealing with images and 3D models, such as computer graphics, image processing, visualization, computer vision, virtual and augmented reality, video processing, and computational visualistics. Visual computing also includes aspects of pattern recognition, human computer interaction, machine learning and digital libraries. The core challenges are the acquisition, processing, analysis and rendering of visual information (mainly images and video). Application areas include industrial quality control, medical image processing and visualization, surveying, robotics, multimedia systems, virtual heritage, special effects in movies and television, and Ludology. This includes Digital Arts and Digital Media Studies. History and overview Visual computing is a fairly new term, which got its current meaning around 2005, when the International Symposium on Visual Computing first convened. Areas of computer technology co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Science
Computational science, also known as scientific computing, technical computing or scientific computation (SC), is a division of science, and more specifically the Computer Sciences, which uses advanced computing capabilities to understand and solve complex physical problems. While this typically extends into computational specializations, this field of study includes: * Algorithms ( numerical and non-numerical): mathematical models, computational models, and computer simulations developed to solve sciences (e.g, physical, biological, and social), engineering, and humanities problems * Computer hardware that develops and optimizes the advanced system hardware, firmware, networking, and data management components needed to solve computationally demanding problems * The computing infrastructure that supports both the science and engineering problem solving and the developmental computer and information science In practical use, it is typically the application of compu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Padé Approximant
In mathematics, a Padé approximant is the "best" approximation of a function near a specific point by a rational function of given order. Under this technique, the approximant's power series agrees with the power series of the function it is approximating. The technique was developed around 1890 by Henri Padé, but goes back to Georg Frobenius, who introduced the idea and investigated the features of rational approximations of power series. The Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. For these reasons Padé approximants are used extensively in computer calculations. They have also been used as auxiliary functions in Diophantine approximation and transcendental number theory, though for sharp results ad hoc methods—in some sense inspired by the Padé theory—typically replace them. Since a Padé approximant is a rational function, an artificial sin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Floating Point
In computing, floating-point arithmetic (FP) is arithmetic on subsets of real numbers formed by a ''significand'' (a signed sequence of a fixed number of digits in some base) multiplied by an integer power of that base. Numbers of this form are called floating-point numbers. For example, the number 2469/200 is a floating-point number in base ten with five digits: 2469/200 = 12.345 = \! \underbrace_\text \! \times \! \underbrace_\text\!\!\!\!\!\!\!\overbrace^ However, 7716/625 = 12.3456 is not a floating-point number in base ten with five digits—it needs six digits. The nearest floating-point number with only five digits is 12.346. And 1/3 = 0.3333… is not a floating-point number in base ten with any finite number of digits. In practice, most floating-point systems use base two, though base ten (decimal floating point) is also common. Floating-point arithmetic operations, such as addition and division, approximate the corresponding real number arithmetic operations ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Maple (software)
Maple is a symbolic and numeric computing environment as well as a multi-paradigm programming language. It covers several areas of technical computing, such as symbolic mathematics, numerical analysis, data processing, visualization, and others. A toolbox, MapleSim, adds functionality for multidomain physical modeling and code generation. Maple's capacity for symbolic computing include those of a general-purpose computer algebra system. For instance, it can manipulate mathematical expressions and find symbolic solutions to certain problems, such as those arising from ordinary and partial differential equations. Maple is developed commercially by the Canadian software company Maplesoft. The name 'Maple' is a reference to the software's Canadian heritage. Overview Core functionality Users can enter mathematics in traditional mathematical notation. Custom user interfaces can also be created. There is support for numeric computations, to arbitrary precision, as well as symbo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Multistep Method
Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an initial point and then takes a short step forward in time to find the next solution point. The process continues with subsequent steps to map out the solution. Single-step methods (such as Euler's method) refer to only one previous point and its derivative to determine the current value. Methods such as Runge–Kutta take some intermediate steps (for example, a half-step) to obtain a higher order method, but then discard all previous information before taking a second step. Multistep methods attempt to gain efficiency by keeping and using the information from previous steps rather than discarding it. Consequently, multistep methods refer to several previous points and derivative values. In the case of ''linear'' multistep methods, a linear combination of the previous points and derivative values is used. Definitions Numerical methods ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discretization
In applied mathematics, discretization is the process of transferring continuous functions, models, variables, and equations into discrete counterparts. This process is usually carried out as a first step toward making them suitable for numerical evaluation and implementation on digital computers. Dichotomization is the special case of discretization in which the number of discrete classes is 2, which can approximate a continuous variable as a binary variable (creating a dichotomy for modeling purposes, as in binary classification). Discretization is also related to discrete mathematics, and is an important component of granular computing. In this context, ''discretization'' may also refer to modification of variable or category ''granularity'', as when multiple discrete variables are aggregated or multiple discrete categories fused. Whenever continuous data is discretized, there is always some amount of discretization error. The goal is to reduce the amount to a level ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Differential Equation
In mathematics, a linear differential equation is a differential equation that is linear equation, linear in the unknown function and its derivatives, so it can be written in the form a_0(x)y + a_1(x)y' + a_2(x)y'' \cdots + a_n(x)y^ = b(x) where and are arbitrary differentiable functions that do not need to be linear, and are the successive derivatives of an unknown function of the variable . Such an equation is an ordinary differential equation (ODE). A ''linear differential equation'' may also be a linear partial differential equation (PDE), if the unknown function depends on several variables, and the derivatives that appear in the equation are partial derivatives. Types of solution A linear differential equation or a system of linear equations such that the associated homogeneous equations have constant coefficients may be solved by quadrature, which means that the solutions may be expressed in terms of antiderivative, integrals. This is also true for a linear equation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Picard–Lindelöf Theorem
In mathematics, specifically the study of differential equations, the Picard–Lindelöf theorem gives a set of conditions under which an initial value problem has a unique solution. It is also known as Picard's existence theorem, the Cauchy–Lipschitz theorem, or the existence and uniqueness theorem. The theorem is named after Émile Picard, Ernst Lindelöf, Rudolf Lipschitz and Augustin-Louis Cauchy. Theorem Let D \subseteq \R \times \R^n be a closed rectangle with (t_0, y_0) \in \operatorname D, the interior of D. Let f: D \to \R^n be a function that is continuous in t and Lipschitz continuous in y (with Lipschitz constant independent from t). Then there exists some \varepsilon > 0 such that the initial value problem y'(t)=f(t,y(t)),\qquad y(t_0)=y_0 has a unique solution y(t) on the interval _0-\varepsilon, t_0+\varepsilon/math>. Proof sketch A standard proof relies on transforming the differential equation into an integral equation, then applying the Banach fixe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
