|
Affine Arithmetic
Affine arithmetic (AA) is a model for self-validated numerical analysis. In AA, the quantities of interest are represented as affine combinations (affine forms) of certain primitive variables, which stand for sources of uncertainty in the data or approximations made during the computation. Affine arithmetic is meant to be an improvement on interval arithmetic (IA), and is similar to generalized interval arithmetic, first-order Taylor arithmetic, the center-slope model, and ellipsoid calculus — in the sense that it is an automatic method to derive first-order guaranteed approximations to general formulas. Affine arithmetic is potentially useful in every numeric problem where one needs guaranteed enclosures to smooth functions, such as solving systems of non-linear equations, analyzing dynamical systems, integrating functions, differential equations, etc. Applications include ray tracing, plotting curves, intersecting implicit and parametric surfaces, error analysis (m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Validated Numerics
Validated numerics, or rigorous computation, verified computation, reliable computation, numerical verification (german: Zuverlässiges Rechnen) is numerics including mathematically strict error (rounding error, truncation error, discretization error) evaluation, and it is one field of numerical analysis. For computation, interval arithmetic is used, and all results are represented by intervals. Validated numerics were used by Warwick Tucker in order to solve the 14th of Smale's problems, and today it is recognized as a powerful tool for the study of dynamical systems. Importance Computation without verification may cause unfortunate results. Below are some examples. Rump's example In the 1980s, Rump made an example. He made a complicated function and tried to obtain its value. Single precision, double precision, extended precision results seemed to be correct, but its plus-minus sign was different from the true value. Phantom solution Breuer–Plum–McKenna used the spectrum m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Curve
In mathematics, a curve (also called a curved line in older texts) is an object similar to a line (geometry), line, but that does not have to be Linearity, straight. Intuitively, a curve may be thought of as the trace left by a moving point (geometry), point. This is the definition that appeared more than 2000 years ago in Euclid's Elements, Euclid's ''Elements'': "The [curved] line is […] the first species of quantity, which has only one dimension, namely length, without any width nor depth, and is nothing else than the flow or run of the point which […] will leave from its imaginary moving some vestige in length, exempt of any width." This definition of a curve has been formalized in modern mathematics as: ''A curve is the image (mathematics), image of an interval (mathematics), interval to a topological space by a continuous function''. In some contexts, the function that defines the curve is called a ''parametrization'', and the curve is a parametric curve. In this artic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sparse Array
Sparse is a computer software tool designed to find possible coding faults in the Linux kernel. Unlike other such tools, this static analysis tool was initially designed to only flag constructs that were likely to be of interest to kernel developers, such as the mixing of pointers to user and kernel address spaces. Sparse checks for known problems and allows the developer to include annotations in the code that convey information about data types, such as the address space that pointers point to and the locks that a function acquires or releases. Linus Torvalds started writing Sparse in 2003. Josh Triplett was its maintainer from 2006, a role taken over by Christopher Li in 2009 and by Luc Van Oostenryck in November 2018. Sparse is released under the MIT License. Annotations Some of the checks performed by Sparse require annotating the source code using the __attribute__ GCC extension, or the Sparse-specific __context__ specifier. Sparse defines the following list of attribu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zonotope
In geometry, a zonohedron is a convex polyhedron that is centrally symmetric, every face of which is a polygon that is centrally symmetric (a zonogon). Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in three-dimensional space, or as the three-dimensional projection of a hypercube. Zonohedra were originally defined and studied by E. S. Fedorov, a Russian crystallographer. More generally, in any dimension, the Minkowski sum of line segments forms a polytope known as a zonotope. Zonohedra that tile space The original motivation for studying zonohedra is that the Voronoi diagram of any lattice forms a convex uniform honeycomb in which the cells are zonohedra. Any zonohedron formed in this way can tessellate 3-dimensional space and is called a primary parallelohedron. Each primary parallelohedron is combinatorially equivalent to one of five types: the rhombohedron (including the cube), hexagonal prism, truncated octahedron, rhombic dodec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rectangle
In Euclidean plane geometry, a rectangle is a quadrilateral with four right angles. It can also be defined as: an equiangular quadrilateral, since equiangular means that all of its angles are equal (360°/4 = 90°); or a parallelogram containing a right angle. A rectangle with four sides of equal length is a ''square''. The term "oblong" is occasionally used to refer to a non-square rectangle. A rectangle with vertices ''ABCD'' would be denoted as . The word rectangle comes from the Latin ''rectangulus'', which is a combination of ''rectus'' (as an adjective, right, proper) and ''angulus'' (angle). A crossed rectangle is a crossed (self-intersecting) quadrilateral which consists of two opposite sides of a rectangle along with the two diagonals (therefore only two sides are parallel). It is a special case of an antiparallelogram, and its angles are not right angles and not all equal, though opposite angles are equal. Other geometries, such as spherical, elliptic, and hyperboli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hexagon
In geometry, a hexagon (from Ancient Greek, Greek , , meaning "six", and , , meaning "corner, angle") is a six-sided polygon. The total of the internal angles of any simple polygon, simple (non-self-intersecting) hexagon is 720°. Regular hexagon A ''regular polygon, regular hexagon'' has Schläfli symbol and can also be constructed as a Truncation (geometry), truncated equilateral triangle, t, which alternates two types of edges. A regular hexagon is defined as a hexagon that is both equilateral polygon, equilateral and equiangular polygon, equiangular. It is bicentric polygon, bicentric, meaning that it is both cyclic polygon, cyclic (has a circumscribed circle) and tangential polygon, tangential (has an inscribed circle). The common length of the sides equals the radius of the circumscribed circle or circumcircle, which equals \tfrac times the apothem (radius of the inscribed figure, inscribed circle). All internal angles are 120 degree (angle), degrees. A regular hexago ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Product
In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is : A\times B = \. A table can be created by taking the Cartesian product of a set of rows and a set of columns. If the Cartesian product is taken, the cells of the table contain ordered pairs of the form . One can similarly define the Cartesian product of ''n'' sets, also known as an ''n''-fold Cartesian product, which can be represented by an ''n''-dimensional array, where each element is an ''n''-tuple. An ordered pair is a 2-tuple or couple. More generally still, one can define the Cartesian product of an indexed family of sets. The Cartesian product is named after René Descartes, whose formulation of analytic geometry gave rise to the concept, which is further generalized in terms of direct product. Examples A deck of cards An ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Electric Circuit
An electrical network is an interconnection of electrical components (e.g., batteries, resistors, inductors, capacitors, switches, transistors) or a model of such an interconnection, consisting of electrical elements (e.g., voltage sources, current sources, resistances, inductances, capacitances). An electrical circuit is a network consisting of a closed loop, giving a return path for the current. Linear electrical networks, a special type consisting only of sources (voltage or current), linear lumped elements (resistors, capacitors, inductors), and linear distributed elements (transmission lines), have the property that signals are linearly superimposable. They are thus more easily analyzed, using powerful frequency domain methods such as Laplace transforms, to determine DC response, AC response, and transient response. A resistive circuit is a circuit containing only resistors and ideal current and voltage sources. Analysis of resistive circuits is less complicated t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Process Control
An industrial process control in continuous production processes is a discipline that uses industrial control systems to achieve a production level of consistency, economy and safety which could not be achieved purely by human manual control. It is implemented widely in industries such as automotive, mining, dredging, oil refining, pulp and paper manufacturing, chemical processing and power generating plants. There is a wide range of size, type and complexity, but it enables a small number of operators to manage complex processes to a high degree of consistency. The development of large industrial process control systems was instrumental in enabling the design of large high volume and complex processes, which could not be otherwise economically or safely operated. The applications can range from controlling the temperature and level of a single process vessel, to a complete chemical processing plant with several thousand control loops. History Early process control breakthrou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Error Analysis (mathematics)
In mathematics, error analysis is the study of kind and quantity of error, or uncertainty, that may be present in the solution to a problem. This issue is particularly prominent in applied areas such as numerical analysis and statistics. Error analysis in numerical modeling In numerical simulation or modeling of real systems, error analysis is concerned with the changes in the output of the model as the parameters to the model vary about a mean. For instance, in a system modeled as a function of two variables z \,=\, f(x,y). Error analysis deals with the propagation of the numerical errors in x and y (around mean values \bar and \bar) to error in z (around a mean \bar). In numerical analysis, error analysis comprises both forward error analysis and backward error analysis. Forward error analysis Forward error analysis involves the analysis of a function z' = f'(a_0,\,a_1,\,\dots,\,a_n) which is an approximation (usually a finite polynomial) to a function z \,=\, f(a_0,a_1,\do ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parametric Surface
A parametric surface is a surface in the Euclidean space \R^3 which is defined by a parametric equation with two parameters Parametric representation is a very general way to specify a surface, as well as implicit representation. Surfaces that occur in two of the main theorems of vector calculus, Stokes' theorem and the divergence theorem, are frequently given in a parametric form. The curvature and arc length of curves on the surface, surface area, differential geometric invariants such as the first and second fundamental forms, Gaussian, mean, and principal curvatures can all be computed from a given parametrization. Examples * The simplest type of parametric surfaces is given by the graphs of functions of two variables: z = f(x,y), \quad \mathbf r(x,y) = (x, y, f(x,y)). * A rational surface is a surface that admits parameterizations by a rational function. A rational surface is an algebraic surface. Given an algebraic surface, it is commonly easier to decide if i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Implicit Surface
In mathematics, an implicit surface is a surface in Euclidean space defined by an equation : F(x,y,z)=0. An ''implicit surface'' is the set of zeros of a function of three variables. ''Implicit'' means that the equation is not solved for or or . The graph of a function is usually described by an equation z=f(x,y) and is called an ''explicit'' representation. The third essential description of a surface is the '' parametric'' one: (x(s,t),y(s,t), z(s,t)), where the -, - and -coordinates of surface points are represented by three functions x(s,t)\, , y(s,t)\, , z(s,t) depending on common parameters s,t. Generally the change of representations is simple only when the explicit representation z=f(x,y) is given: z-f(x,y)=0 (implicit), (s,t,f(s,t)) (parametric). ''Examples'': #The plane x+2y-3z+1=0. #The sphere x^2+y^2+z^2-4=0. #The torus (x^2+y^2+z^2+R^2-a^2)^2-4R^2(x^2+y^2)=0. #A surface of genus 2: 2y(y^2-3x^2)(1-z^2)+(x^2+y^2)^2-(9z^2-1)(1-z^2)=0 (see diagram). #The su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.png "Click for more on -> Parametric Surface")
