|
Level Set Method
Level-set methods (LSM) are a conceptual framework for using level sets as a tool for numerical analysis of surfaces and shapes. The advantage of the level-set model is that one can perform numerical computations involving curves and surfaces on a fixed Cartesian grid without having to parameterize these objects (this is called the ''Eulerian approach''). Also, the level-set method makes it very easy to follow shapes that change topology, for example, when a shape splits in two, develops holes, or the reverse of these operations. All these make the level-set method a great tool for modeling time-varying objects, like inflation of an airbag, or a drop of oil floating in water. The figure on the right illustrates several important ideas about the level-set method. In the upper-left corner we see a shape; that is, a bounded region with a well-behaved boundary. Below it, the red surface is the graph of a level set function \varphi determining this shape, and the flat blue region r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business internationally, o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Optimization (mathematics)
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems of sorts arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries. In the more general approach, an optimization problem consists of maximizing or minimizing a real function by systematically choosing input values from within an allowed set and computing the value of the function. The generalization of optimization theory and techniques to other formulations constitutes a large area of applied mathematics. More generally, optimization includes finding "best available" values of some objective function given a define ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity. Analysis of algorithms, Computational complexity is central to computational geometry, with great practical significance if algorithms are used on very large datasets containing tens or hundreds of millions of points. For such sets, the difference between O(''n''2) and O(''n'' log ''n'') may be the difference between days and seconds of computation. The main impetus for the development of computational geometry as a discipline was progress in computer graphics and computer-aided design and manufacturing (Computer-aided design, CAD/Compu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Graphics
Computer graphics deals with generating images with the aid of computers. Today, computer graphics is a core technology in digital photography, film, video games, cell phone and computer displays, and many specialized applications. A great deal of specialized hardware and software has been developed, with the displays of most devices being driven by computer graphics hardware. It is a vast and recently developed area of computer science. The phrase was coined in 1960 by computer graphics researchers Verne Hudson and William Fetter of Boeing. It is often abbreviated as CG, or typically in the context of film as computer generated imagery (CGI). The non-artistic aspects of computer graphics are the subject of computer science research. Some topics in computer graphics include user interface design, sprite graphics, rendering, ray tracing, geometry processing, computer animation, vector graphics, 3D modeling, shaders, GPU design, implicit surfaces, visualization, scientific c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Image Processing
An image is a visual representation of something. It can be two-dimensional, three-dimensional, or somehow otherwise feed into the visual system to convey information. An image can be an artifact, such as a photograph or other two-dimensional picture, that resembles a subject. In the context of signal processing, an image is a distributed amplitude of color(s). In optics, the term “image” may refer specifically to a 2D image. An image does not have to use the entire visual system to be a visual representation. A popular example of this is of a greyscale image, which uses the visual system's sensitivity to brightness across all wavelengths, without taking into account different colors. A black and white visual representation of something is still an image, even though it does not make full use of the visual system's capabilities. Images are typically still, but in some cases can be moving or animated. Characteristics Images may be two or three-dimensional, such as a pho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
James Sethian
James Albert Sethian is a professor of mathematics at the University of California, Berkeley and the head of the Mathematics Grouat the United States Department of Energy, United States Department of Energy's Lawrence Berkeley National Laboratory. Sethian was born in Washington, D.C. on May 10, 1954. He received a B.A. (1976) from Princeton and a M.A. (1978) and Ph.D (1982) from Berkeley under the direction of Alexandre Chorin. Beginning in 1983, he was a National Science Foundation postdoctoral fellow, lastly at the Courant Institute under Peter Lax. In 1985, he returned to Berkeley to join the mathematics faculty, where he is currently a full professor. Sethian was elected member of the National Academy of Engineering in 2008 as well as the National Academy of Sciences in 2013. Sethian has acted as Interim Director Research at Thinking Machines Corporation and held visiting positions at the National Center for Atmospheric Research and the National Institute of Standards and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stanley Osher
Stanley Osher (born April 24, 1942) is an American mathematician, known for his many contributions in shock capturing, level-set methods, and PDE-based methods in computer vision and image processing. Osher is a professor at the University of California, Los Angeles (UCLA), Director of Special Projects in the Institute for Pure and Applied Mathematics (IPAM) and member of the California NanoSystems Institute (CNSI) at UCLA. He has a daughter, Kathryn, and a son, Joel. Education * BS, Brooklyn College, 1962 * MS, New York University, 1964 * PhD, New York University, 1966 Research interests * Level-set methods for computing moving fronts * Approximation methods for hyperbolic conservation laws and Hamilton–Jacobi equations * Total variation (TV) and other PDE-based image processing techniques * Scientific computing * Applied partial differential equations * L1/TV-based convex optimization Osher is listed as an ISI highly cited researcher. Research contributions Osher was th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
G Equation
In Combustion, G equation is a scalar G(\mathbf,t) field equation which describes the instantaneous flame position, introduced by Forman A. Williams in 1985 in the study of premixed turbulent combustion. The equation is derived based on the Level-set method. The equation was studied by George H. Markstein earlier, in a restrictive form. Mathematical descriptionWilliams, Forman A. "Combustion theory." (1985). The G equation reads as :\frac + \mathbf\cdot\nabla G = U_L , \nabla G, where *\mathbf is the flow velocity field *U_L is the local burning velocity The flame location is given by G(\mathbf,t)=G_o which can be defined arbitrarily such that G(\mathbf,t)>G_o is the region of burnt gas and G(\mathbf,t) Local burning velocity The burning velocity of the[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combustion
Combustion, or burning, is a high-temperature exothermic redox chemical reaction between a fuel (the reductant) and an oxidant, usually atmospheric oxygen, that produces oxidized, often gaseous products, in a mixture termed as smoke. Combustion does not always result in fire, because a flame is only visible when substances undergoing combustion vaporize, but when it does, a flame is a characteristic indicator of the reaction. While the activation energy must be overcome to initiate combustion (e.g., using a lit match to light a fire), the heat from a flame may provide enough energy to make the reaction self-sustaining. Combustion is often a complicated sequence of elementary radical reactions. Solid fuels, such as wood and coal, first undergo endothermic pyrolysis to produce gaseous fuels whose combustion then supplies the heat required to produce more of them. Combustion is often hot enough that incandescent light in the form of either glowing or a flame is produced. A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eikonal Equation
An eikonal equation (from Greek εἰκών, image) is a non-linear first-order partial differential equation that is encountered in problems of wave propagation. The classical eikonal equation in geometric optics is a differential equation of the form where x lies in an open subset of \mathbb^n, n(x) is a positive function, \nabla denotes the gradient, and , \cdot , is the Euclidean norm. The function n is given and one seeks solutions u . In the context of geometric optics, the function n is the refractive index of the medium. More generally, an eikonal equation is an equation of the form where H is a function of 2n variables. Here the function H is given, and u is the solution. If H(x,y)= , y, - n(x) , then equation () becomes (). Eikonal equations naturally arise in the WKB method and the study of Maxwell's equations. Eikonal equations provide a link between physical (wave) optics and geometric (ray) optics. One fast computational algorith ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Essentially Non-oscillatory
ENO (essentially non-oscillatory) methods are classes of high-resolution schemes in numerical solution of differential equations. History The first ENO scheme was developed by Ami Harten, Harten, Björn Engquist, Engquist, Stanley Osher, Osher and Chakravarthy in 1987. In 1994, the first WENO methods, weighted version of ENO was developed. See also *High-resolution scheme *WENO methods *Shock-capturing method References Numerical differential equations Computational fluid dynamics {{fluiddynamics-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
