|
Spring System
In engineering and physics, a spring system or spring network is a model of physics described as a graph with a position at each vertex and a spring of given stiffness and length along each edge. This generalizes Hooke's law to higher dimensions. This simple model can be used to solve the pose of static systems from crystal lattice to springs. A spring system can be thought of as the simplest case of the finite element method for solving problems in statics. Assuming linear springs and small deformation (or restricting to one-dimensional motion) a spring system can be cast as a (possibly overdetermined) system of linear equations or equivalently as an energy minimization problem. Known spring lengths If the nominal lengths, ''L'', of the springs are known to be 1 and 2 units respectively, then the system can be solved as follows: Consider the simple case of three nodes connected by two springs. Then the stretching of the two springs is given as a function of the positions of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elastic Network Model
Elastic is a word often used to describe or identify certain types of elastomer, elastic used in garments or stretchable fabrics. Elastic may also refer to: Alternative name * Rubber band, ring-shaped band of rubber used to hold objects together * Bungee cord, a cord composed of an elastic core covered in a sheath * Chinese jump rope, a children's game resembling hopscotch and jump rope As a proper name * ''Elastic'' (album), a 2002 album by jazz saxophonist Joshua Redman * Elastic NV, the company that releases the Elasticsearch search engine ** Elasticsearch, a search engine based on Apache Lucene * Amazon Elastic Compute Cloud (Amazon EC2), a web service that provides secure, resizable compute capacity in a cloud format * Elastics (orthodontics), rubber bands used in orthodontics See also * Elastic collision, a collision where kinetic energy is conserved * Elastic deformation, reversible deformation of a material * Elasticity (other) * Flex (other) * St ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diagonal Matrix
In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is \left begin 3 & 0 \\ 0 & 2 \end\right/math>, while an example of a 3×3 diagonal matrix is \left begin 6 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end\right/math>. An identity matrix of any size, or any multiple of it (a scalar matrix), is a diagonal matrix. A diagonal matrix is sometimes called a scaling matrix, since matrix multiplication with it results in changing scale (size). Its determinant is the product of its diagonal values. Definition As stated above, a diagonal matrix is a matrix in which all off-diagonal entries are zero. That is, the matrix with ''n'' columns and ''n'' rows is diagonal if \forall i,j \in \, i \ne j \implies d_ = 0. However, the main diagonal entries are unrestricted. The term ''diagonal matrix'' may s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springs (mechanical)
Spring(s) may refer to: Common uses * Spring (season), a season of the year * Spring (device), a mechanical device that stores energy * Spring (hydrology), a natural source of water * Spring (mathematics), a geometric surface in the shape of a helically coiled tube * Spring (political terminology), often used to name periods of political liberalization * Springs (tide), in oceanography, the maximum tide, occurs twice a month during the full and new moon Places * Spring (Milz), a river in Thuringia, Germany * Spring, Alabel, a barangay unit in Alabel, Sarangani Province, Philippines * Șpring, a commune in Alba County, Romania * Șpring (river), a river in Alba County, Romania * Springs, Gauteng, South Africa * Springs, the location of Dubai British School, Dubai United States * Springs, New York, a part of East Hampton, New York * Springs, Pennsylvania, an unincorporated community * Spring, Texas, a census-designated place * Spring District, neighborhood in Bellevue, Washingt ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spring-mass System
In classical mechanics, a harmonic oscillator is a system that, when displaced from its Mechanical equilibrium, equilibrium position, experiences a restoring force ''F'' Proportionality (mathematics), proportional to the displacement ''x'': \vec F = -k \vec x, where ''k'' is a positive coefficient, constant. If ''F'' is the only force acting on the system, the system is called a simple harmonic oscillator, and it undergoes simple harmonic motion: sinusoidal oscillations about the equilibrium point, with a constant amplitude and a constant frequency (which does not depend on the amplitude). If a frictional force (Damping ratio, damping) proportional to the velocity is also present, the harmonic oscillator is described as a damped oscillator. Depending on the friction coefficient, the system can: * Oscillate with a frequency lower than in the Damping ratio, undamped case, and an amplitude decreasing with time (Damping ratio, underdamped oscillator). * Decay to the equilibrium p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stiffness Matrix
In the finite element method for the numerical solution of elliptic partial differential equations, the stiffness matrix is a matrix that represents the system of linear equations that must be solved in order to ascertain an approximate solution to the differential equation. The stiffness matrix for the Poisson problem For simplicity, we will first consider the Poisson problem : -\nabla^2 u = f on some domain , subject to the boundary condition on the boundary of . To discretize this equation by the finite element method, one chooses a set of ''basis functions'' defined on which also vanish on the boundary. One then approximates : u \approx u^h = u_1\varphi_1+\cdots+u_n\varphi_n. The coefficients are determined so that the error in the approximation is orthogonal to each basis function : : \int_\Omega \varphi_i\cdot f \, dx = -\int_\Omega \varphi_i\nabla^2u^h \, dx = -\sum_j\left(\int_\Omega \varphi_i\nabla^2\varphi_j\,dx\right)\, u_j = \sum_j\left(\int_\Omega \nabla\var ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Anisotropic Network Model
The Anisotropic Network Model (ANM) is a simple yet powerful tool made for normal mode analysis of proteins, which has been successfully applied for exploring the relation between function and dynamics for many proteins. It is essentially an Elastic Network Model for the Cα atoms with a step function for the dependence of the force constants on the inter-particle distance. Theory The Anisotropic Network Model was introduced in 2000 (Atilgan et al., 2001; Doruker et al., 2000), inspired by the pioneering work of Tirion (1996), succeeded by the development of the Gaussian network model (GNM) (Bahar et al., 1997; Haliloglu et al., 1997), and by the work of Hinsen (1998) who first demonstrated the validity of performing EN NMA at residue level. It represents the biological macromolecule as an elastic mass-and-spring network, to explain the internal motions of a protein subject to a harmonic potential. In the network each node is the Cα atom of the residue and the springs represen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gaussian Network Model
The Gaussian network model (GNM) is a representation of a biological macromolecule as an elastic mass-and-spring network to study, understand, and characterize the mechanical aspects of its long-time large-scale dynamics. The model has a wide range of applications from small proteins such as enzymes composed of a single domain, to large macromolecular assemblies such as a ribosome or a viral capsid. Protein domain dynamics plays key roles in a multitude of molecular recognition and cell signalling processes. Protein domains, connected by intrinsically disordered flexible linker domains, induce long-range allostery via protein domain dynamics. The resultant dynamic modes cannot be generally predicted from static structures of either the entire protein or individual domains. The Gaussian network model is a minimalist, coarse-grained approach to study biological molecules. In the model, proteins are represented by nodes corresponding to α-carbons of the amino acid residues. Sim ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Laplacian Matrix
In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix or discrete Laplacian, is a matrix representation of a graph. Named after Pierre-Simon Laplace, the graph Laplacian matrix can be viewed as a matrix form of the negative discrete Laplace operator on a graph approximating the negative continuous Laplacian obtained by the finite difference method. The Laplacian matrix relates to many useful properties of a graph. Together with Kirchhoff's theorem, it can be used to calculate the number of spanning trees for a given graph. The sparsest cut of a graph can be approximated through the Fiedler vector — the eigenvector corresponding to the second smallest eigenvalue of the graph Laplacian — as established by Cheeger's inequality. The spectral decomposition of the Laplacian matrix allows constructing low dimensional embeddings that appear in many machine learning applications and determines a spectr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity Matrix
In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere. Terminology and notation The identity matrix is often denoted by I_n, or simply by I if the size is immaterial or can be trivially determined by the context. I_1 = \begin 1 \end ,\ I_2 = \begin 1 & 0 \\ 0 & 1 \end ,\ I_3 = \begin 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end ,\ \dots ,\ I_n = \begin 1 & 0 & 0 & \cdots & 0 \\ 0 & 1 & 0 & \cdots & 0 \\ 0 & 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & 0 & \cdots & 1 \end. The term unit matrix has also been widely used, but the term ''identity matrix'' is now standard. The term ''unit matrix'' is ambiguous, because it is also used for a matrix of ones and for any unit of the ring of all n\times n matrices. In some fields, such as group theory or quantum mechanics, the identity matrix is sometimes denoted by a boldface one, \mathbf, or called "id" (short for identity). ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dirichlet Boundary Condition
In the mathematical study of differential equations, the Dirichlet (or first-type) boundary condition is a type of boundary condition, named after Peter Gustav Lejeune Dirichlet (1805–1859). When imposed on an ordinary or a partial differential equation, it specifies the values that a solution needs to take along the boundary of the domain. In finite element method (FEM) analysis, ''essential'' or Dirichlet boundary condition is defined by weighted-integral form of a differential equation. The dependent unknown ''u in the same form as the weight function w'' appearing in the boundary expression is termed a ''primary variable'', and its specification constitutes the ''essential'' or Dirichlet boundary condition. The question of finding solutions to such equations is known as the Dirichlet problem. In applied sciences, a Dirichlet boundary condition may also be referred to as a fixed boundary condition. Examples ODE For an ordinary differential equation, for instance, y'' + y ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Incidence Matrix
In mathematics, an incidence matrix is a logical matrix that shows the relationship between two classes of objects, usually called an incidence relation. If the first class is ''X'' and the second is ''Y'', the matrix has one row for each element of ''X'' and one column for each element of ''Y''. The entry in row ''x'' and column ''y'' is 1 if ''x'' and ''y'' are related (called ''incident'' in this context) and 0 if they are not. There are variations; see below. Graph theory Incidence matrix is a common graph representation in graph theory. It is different to an adjacency matrix, which encodes the relation of vertex-vertex pairs. Undirected and directed graphs In graph theory an undirected graph has two kinds of incidence matrices: unoriented and oriented. The ''unoriented incidence matrix'' (or simply ''incidence matrix'') of an undirected graph is a n\times m matrix ''B'', where ''n'' and ''m'' are the numbers of vertices and edges respectively, such that :B_=\left\{\begin{a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a Set (mathematics), set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') and each of the related pairs of vertices is called an ''edge'' (also called ''link'' or ''line''). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics. The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person ''A'' can shake hands with a person ''B'' only if ''B'' also shakes hands with ''A''. In contrast, if an edge from a person ''A'' to a person ''B'' m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
