|
Discrete Least Squares Meshless Method
In mathematics the discrete least squares meshless (DLSM) method is a meshless method based on the least squares concept. The method is based on the minimization of a least squares functional, defined as the weighted summation of the squared residual of the governing differential equation and its boundary conditions at nodal points used to discretize the domain and its boundaries. Description While most of the existing meshless methods need background cells for numerical integration, DLSM did not require a numerical integration procedure due to the use of the discrete least squares method to discretize the governing differential equation. A Moving least squares (MLS) approximation method is used to construct the shape function, making the approach a fully least squares-based approach. Arzani and Afshar developed the DLSM method in 2006 for the solution of Poisson's equation. Firoozjaee and Afshar proposed the collocated discrete least squares meshless (CDLSM) method to solve el ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting poin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolic Distribution
The hyperbolic distribution is a continuous probability distribution characterized by the logarithm of the probability density function being a hyperbola. Thus the distribution decreases exponentially, which is more slowly than the normal distribution. It is therefore suitable to model phenomena where numerically large values are more probable than is the case for the normal distribution. Examples are returns from financial assets and turbulent wind speeds. The hyperbolic distributions form a subclass of the generalised hyperbolic distributions. The origin of the distribution is the observation by Ralph Bagnold, published in his book '' The Physics of Blown Sand and Desert Dunes'' (1941), that the logarithm of the histogram of the empirical size distribution of sand deposits tends to form a hyperbola. This observation was formalised mathematically by Ole Barndorff-Nielsen in a paper in 1977, where he also introduced the generalised hyperbolic distribution The generalised hyperbol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ivo Babuška
Ivo M. Babuška (born March 22, 1926, in Prague) is a Czech- American mathematician, noted for his studies of the finite element method and the proof of the Babuška–Lax–Milgram theorem in partial differential equations. One of the celebrated result in the finite elements is the so-called Ladyzenskaja–Babuška–Brezzi (LBB) condition (also referred to in some literature as Banach–Necas–Babuška (BNB)), which provides sufficient conditions for a stable mixed formulation. The LBB condition has guided mathematicians and engineers to develop state-of-the-art formulations for many technologically important problems like Darcy flow, Stokes flow, incompressible Navier–Stokes, nearly incompressible elasticity. He is also well known for his work on adaptive methods and the '' p-''- and '' hp-''-versions of the finite element method. He also developed the mathematical framework for the partition of unity methods. Babuska was elected as a member to the National Academy of E ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Olga Aleksandrovna Ladyzhenskaya
Olga Aleksandrovna Ladyzhenskaya (russian: Óльга Алекса́ндровна Лады́женская, link=no, p=ˈolʲɡə ɐlʲɪˈksandrəvnə ɫɐˈdɨʐɨnskəɪ̯ə, a=Ru-Olga Aleksandrovna Ladyzhenskaya.wav; 7 March 1922 – 12 January 2004) was a Russian mathematician who worked on partial differential equations, fluid dynamics, and the finite difference method for the Navier–Stokes equations. She received the Lomonosov Gold Medal in 2002. She is the author of more than two hundred scientific works, among which are six monographs. Biography Ladyzhenskaya was born and grew up in the small town of Kologriv, the daughter of a mathematics teacher who is credited with her early inspiration and love of mathematics. The artist Gennady Ladyzhensky was her grandfather's brother, also born in this town. In 1937 her father, Aleksandr Ivanovich Ladýzhenski, was arrested by the NKVD and executed as an "enemy of the people". Ladyzhenskaya completed high school in 1939, ... [...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 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 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 can be expressed within a finite amount of spac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Penalty Method
Penalty methods are a certain class of algorithms for solving constrained optimization problems. A penalty method replaces a constrained optimization problem by a series of unconstrained problems whose solutions ideally converge to the solution of the original constrained problem. The unconstrained problems are formed by adding a term, called a penalty function, to the objective function that consists of a ''penalty parameter'' multiplied by a measure of violation of the constraints. The measure of violation is nonzero when the constraints are violated and is zero in the region where constraints are not violated. Example Let us say we are solving the following constrained problem: : \min f(\mathbf x) subject to : c_i(\mathbf x) \le 0 ~\forall i \in I. This problem can be solved as a series of unconstrained minimization problems : \min \Phi_k (\mathbf x) = f (\mathbf x) + \sigma_k ~ \sum_ ~ g(c_i(\mathbf x)) where : g(c_i(\mathbf x))=\max(0,c_i(\mathbf x ))^2. In the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dirichlet
Johann Peter Gustav Lejeune Dirichlet (; 13 February 1805 – 5 May 1859) was a German mathematician who made deep contributions to number theory (including creating the field of analytic number theory), and to the theory of Fourier series and other topics in mathematical analysis; he is credited with being one of the first mathematicians to give the modern formal definition of a function. Although his surname is Lejeune Dirichlet, he is commonly referred to by his mononym Dirichlet, in particular for results named after him. Biography Early life (1805–1822) Gustav Lejeune Dirichlet was born on 13 February 1805 in Düren, a town on the left bank of the Rhine which at the time was part of the First French Empire, reverting to Prussia after the Congress of Vienna in 1815. His father Johann Arnold Lejeune Dirichlet was the postmaster, merchant, and city councilor. His paternal grandfather had come to Düren from Richelette (or more likely Richelle), a small community north ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First-order Approximation
In science, engineering, and other quantitative disciplines, order of approximation refers to formal or informal expressions for how accurate an approximation is. Usage in science and engineering In formal expressions, the ordinal number used before the word order refers to the highest power in the series expansion used in the approximation. The expressions: a ''zeroth-order approximation'', a ''first-order approximation'', a ''second-order approximation'', and so forth are used as fixed phrases. The expression a ''zero-order approximation'' is also common. Cardinal numerals are occasionally used in expressions like an ''order-zero approximation'', an ''order-one approximation'', etc. The omission of the word ''order'' leads to phrases that have less formal meaning. Phrases like first approximation or to a first approximation may refer to ''a roughly approximate value of a quantity''. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equation
In mathematics, an equation is a formula that expresses the equality of two expressions, by connecting them with the equals sign . The word ''equation'' and its cognates in other languages may have subtly different meanings; for example, in French an ''équation'' is defined as containing one or more variables, while in English, any well-formed formula consisting of two expressions related with an equals sign is an equation. ''Solving'' an equation containing variables consists of determining which values of the variables make the equality true. The variables for which the equation has to be solved are also called unknowns, and the values of the unknowns that satisfy the equality are called solutions of the equation. There are two kinds of equations: identities and conditional equations. An identity is true for all values of the variables. A conditional equation is only true for particular values of the variables. An equation is written as two expressions, connected ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stress (mechanics)
In continuum mechanics, stress is a physical quantity. It is a quantity that describes the magnitude of forces that cause deformation. Stress is defined as ''force per unit area''. When an object is pulled apart by a force it will cause elongation which is also known as deformation, like the stretching of an elastic band, it is called tensile stress. But, when the forces result in the compression of an object, it is called compressive stress. It results when forces like tension or compression act on a body. The greater this force and the smaller the cross-sectional area of the body on which it acts, the greater the stress. Therefore, stress is measured in newton per square meter (N/m2) or pascal (Pa). Stress expresses the internal forces that neighbouring particles of a continuous material exert on each other, while strain is the measure of the deformation of the material. For example, when a solid vertical bar is supporting an overhead weight, each particle in the bar pu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adaptive Mesh Refinement
In numerical analysis, adaptive mesh refinement (AMR) is a method of adapting the accuracy of a solution within certain sensitive or turbulent regions of simulation, dynamically and during the time the solution is being calculated. When solutions are calculated numerically, they are often limited to pre-determined quantified grids as in the Cartesian plane which constitute the computational grid, or 'mesh'. Many problems in numerical analysis, however, do not require a uniform precision in the numerical grids used for graph plotting or computational simulation, and would be better suited if specific areas of graphs which needed precision could be refined in quantification only in the regions requiring the added precision. Adaptive mesh refinement provides such a dynamic programming environment for adapting the precision of the numerical computation based on the requirements of a computation problem in specific areas of multi-dimensional graphs which need precision while leaving the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Two-dimensional
In mathematics, a plane is a Euclidean ( flat), two-dimensional surface that extends indefinitely. A plane is the two-dimensional analogue of a point (zero dimensions), a line (one dimension) and three-dimensional space. Planes can arise as subspaces of some higher-dimensional space, as with one of a room's walls, infinitely extended, or they may enjoy an independent existence in their own right, as in the setting of two-dimensional Euclidean geometry. Sometimes the word ''plane'' is used more generally to describe a two-dimensional surface, for example the hyperbolic plane and elliptic plane. When working exclusively in two-dimensional Euclidean space, the definite article is used, so ''the'' plane refers to the whole space. Many fundamental tasks in mathematics, geometry, trigonometry, graph theory, and graphing are performed in a two-dimensional space, often in the plane. Euclidean geometry Euclid set forth the first great landmark of mathematical thought, an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
