|
Computability In Analysis And Physics
''Computability in Analysis and Physics'' is a monograph on computable analysis by Marian Pour-El and J. Ian Richards. It was published by Springer-Verlag in their Perspectives in Mathematical Logic series in 1989, and reprinted by the Association for Symbolic Logic and Cambridge University Press in their Perspectives in Logic series in 2016. Topics The book concerns computable analysis, a branch of mathematical analysis founded by Alan Turing and concerned with the computability of constructions in analysis. This area is connected to, but distinct from, constructive analysis, reverse mathematics, and numerical analysis. The early development of the field was summarized in a book by Oliver Aberth, ''Computable Analysis'' (1980), and ''Computability in Analysis and Physics'' provides an update, incorporating substantial developments in this area by its authors. In contrast to the Russian school of computable analysis led by Andrey Markov Jr., it views computability as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eigenvalue
In linear algebra, an eigenvector () or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denoted by \lambda, is the factor by which the eigenvector is scaled. Geometrically, an eigenvector, corresponding to a real nonzero eigenvalue, points in a direction in which it is stretched by the transformation and the eigenvalue is the factor by which it is stretched. If the eigenvalue is negative, the direction is reversed. Loosely speaking, in a multidimensional vector space, the eigenvector is not rotated. Formal definition If is a linear transformation from a vector space over a field into itself and is a nonzero vector in , then is an eigenvector of if is a scalar multiple of . This can be written as T(\mathbf) = \lambda \mathbf, where is a scalar in , known as the eigenvalue, characteristic value, or characteristic roo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Logic
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and analysis. In the early 20th century it was shaped by David Hilbert's program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in proving consistency. Work in set theory s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robin Gandy
Robin Oliver Gandy (22 September 1919 – 20 November 1995) was a British mathematician and logician. He was a friend, student, and associate of Alan Turing, having been supervised by Turing during his PhD at the University of Cambridge, where they worked together. Education and early life Robin Gandy was born in the village of Rotherfield Peppard, Oxfordshire, England. He was the son of Thomas Hall Gandy (1876–1948), a general practitioner, and Ida Caroline née Hony (1885–1977), a social worker and later an author. He was a great-great-grandson of the architect and artist Joseph Gandy (1771–1843). Educated at Abbotsholme School in Derbyshire, Gandy took two years of the Mathematical Tripos, at King's College, Cambridge, before enlisting for military service in 1940. During World War II he worked on radio intercept equipment at Hanslope Park, where Alan Turing was working on a speech encipherment project, and he became one of Turing's lifelong friends and associates. I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Laplace's Equation
In mathematics and physics, Laplace's equation is a second-order partial differential equation named after Pierre-Simon Laplace, who first studied its properties. This is often written as \nabla^2\! f = 0 or \Delta f = 0, where \Delta = \nabla \cdot \nabla = \nabla^2 is the Laplace operator,The delta symbol, Δ, is also commonly used to represent a finite change in some quantity, for example, \Delta x = x_1 - x_2. Its use to represent the Laplacian should not be confused with this use. \nabla \cdot is the divergence operator (also symbolized "div"), \nabla is the gradient operator (also symbolized "grad"), and f (x, y, z) is a twice-differentiable real-valued function. The Laplace operator therefore maps a scalar function to another scalar function. If the right-hand side is specified as a given function, h(x, y, z), we have \Delta f = h. This is called Poisson's equation, a generalization of Laplace's equation. Laplace's equation and Poisson's equation are the simplest exa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heat Equation
In mathematics and physics, the heat equation is a certain partial differential equation. Solutions of the heat equation are sometimes known as caloric functions. 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. As the prototypical parabolic partial differential equation, the heat equation is among the most widely studied topics in pure mathematics, and its analysis is regarded as fundamental to the broader field of partial differential equations. The heat equation can also be considered on Riemannian manifolds, leading to many geometric applications. Following work of Subbaramiah Minakshisundaram and Åke Pleijel, the heat equation is closely related with spectral geometry. A seminal nonlinear variant of the heat equation was introduced to differential geometry by James Eells and Joseph Sampson in 1964, inspiring the introduction of the Ricci flow by Richard ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gradient
In vector calculus, the gradient of a scalar-valued differentiable function of several variables is the vector field (or vector-valued function) \nabla f whose value at a point p is the "direction and rate of fastest increase". If the gradient of a function is non-zero at a point , the direction of the gradient is the direction in which the function increases most quickly from , and the magnitude of the gradient is the rate of increase in that direction, the greatest absolute directional derivative. Further, a point where the gradient is the zero vector is known as a stationary point. The gradient thus plays a fundamental role in optimization theory, where it is used to maximize a function by gradient ascent. In coordinate-free terms, the gradient of a function f(\bf) may be defined by: :df=\nabla f \cdot d\bf where ''df'' is the total infinitesimal change in ''f'' for an infinitesimal displacement d\bf, and is seen to be maximal when d\bf is in the direction of th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wave Equation
The (two-way) wave equation is a second-order linear partial differential equation for the description of waves or standing wave fields — as they occur in classical physics — such as mechanical waves (e.g. water waves, sound waves and seismic waves) or electromagnetic waves (including light waves). It arises in fields like acoustics, electromagnetism, and fluid dynamics. Single mechanical or electromagnetic waves propagating in a pre-defined direction can also be described with the first-order one-way wave equation which is much easier to solve and also valid for inhomogenious media. Introduction The (two-way) wave equation is a second-order partial differential equation describing waves, including traveling and standing waves; the latter can be considered as linear superpositions of waves traveling in opposite directions. This article mostly focuses on the scalar wave equation describing waves in scalars by scalar functions of a time variable (a variable repres ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Initial Conditions
In mathematics and particularly in dynamic systems, an initial condition, in some contexts called a seed value, is a value of an evolving variable at some point in time designated as the initial time (typically denoted ''t'' = 0). For a system of order ''k'' (the number of time lags in discrete time, or the order of the largest derivative in continuous time) and dimension ''n'' (that is, with ''n'' different evolving variables, which together can be denoted by an ''n''-dimensional coordinate vector), generally ''nk'' initial conditions are needed in order to trace the system's variables forward through time. In both differential equations in continuous time and difference equations in discrete time, initial conditions affect the value of the dynamic variables ( state variables) at any future time. In continuous time, the problem of finding a closed form solution for the state variables as a function of time and of the initial conditions is called the initial value ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Differential Equation
In mathematics, a differential equation is an equation that relates one or more unknown functions and their derivatives. In applications, the functions generally represent physical quantities, the derivatives represent their rates of change, and the differential equation defines a relationship between the two. Such relations are common; therefore, differential equations play a prominent role in many disciplines including engineering, physics, economics, and biology. Mainly the study of differential equations consists of the study of their solutions (the set of functions that satisfy each equation), and of the properties of their solutions. Only the simplest differential equations are solvable by explicit formulas; however, many properties of solutions of a given differential equation may be determined without computing them exactly. Often when a closed-form expression for the solutions is not available, solutions may be approximated numerically using computers. The theory ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dense Subset
In topology and related areas of mathematics, a subset ''A'' of a topological space ''X'' is said to be dense in ''X'' if every point of ''X'' either belongs to ''A'' or else is arbitrarily "close" to a member of ''A'' — for instance, the rational numbers are a dense subset of the real numbers because every real number either is a rational number or has a rational number arbitrarily close to it (see Diophantine approximation). Formally, A is dense in X if the smallest closed subset of X containing A is X itself. The of a topological space X is the least cardinality of a dense subset of X. Definition A subset A of a topological space X is said to be a of X if any of the following equivalent conditions are satisfied: The smallest closed subset of X containing A is X itself. The closure of A in X is equal to X. That is, \operatorname_X A = X. The interior of the complement of A is empty. That is, \operatorname_X (X \setminus A) = \varnothing. Every point in X ei ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Span
In mathematics, the linear span (also called the linear hull or just span) of a set of vectors (from a vector space), denoted , pp. 29-30, §§ 2.5, 2.8 is defined as the set of all linear combinations of the vectors in . It can be characterized either as the intersection of all linear subspaces that contain , or as the smallest subspace containing . The linear span of a set of vectors is therefore a vector space itself. Spans can be generalized to matroids and modules. To express that a vector space is a linear span of a subset , one commonly uses the following phrases—either: spans , is a spanning set of , is spanned/generated by , or is a generator or generator set of . Definition Given a vector space over a field , the span of a set of vectors (not necessarily infinite) is defined to be the intersection of all subspaces of that contain . is referred to as the subspace ''spanned by'' , or by the vectors in . Conversely, is called a ''spanning set'' of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
