# 10.3 The physics of springs  (Page 11/11)

 Page 11 / 11
$e=Fc+ϵ,$

where ϵ is the error in the measurements. Note that if A T is not invertible we can replace ${A}^{-T}$ with ${A}^{+T}$ , where ${A}^{+T}$ is the pseudo inverse of A T , so that $F=diag\left({A}^{+T}f\right)$ .

## Maximum likelihood estimate

With our problem now rewritten in a statistically more usable form, we can easily apply a method involving the maximum likelihood estimate, described by Calvetti and Somersalo [link] , pages 35-37. Applying this method to our rewritten problem yields the equation

$\left[{F}^{T},{\Gamma }^{-1},F\right]c={F}^{T}{\Gamma }^{-1}\overline{e},$

where

$\overline{e}=\frac{1}{N}\sum _{j=1}^{N}{e}_{j},$

and Γ is the covariance matrix of the random variable e . This method assumes that the error is normally distributed, which is a reasonable assumption (see "Distributions" ). Now with this formulation we can solve our problem using statistical knowledge of the problem.

## Problems with maximum likelihood estimate approach

The covariance matrix, Γ , comes from the distribution of ${e}_{j}=A{x}_{j}$ . Then, ${\Gamma }_{\left(e\right)}=A{\Gamma }_{\left(x\right)}{A}^{T}.$ In our problem where $A\in {\mathbb{R}}^{16×14}$ and ${\Gamma }_{\left(x\right)}\in {\mathbb{R}}^{14×14}$ , ${\Gamma }_{\left(e\right)}$ is a singular matrix. In fact in any system where $A\in {\mathbb{R}}^{m×n}$ where $m>n$ , ${\Gamma }_{\left(e\right)}$ is singular. This presents a problem when solving the system

$\left[{F}^{T},{\Gamma }_{\left(e\right)}^{-1},F\right]c={F}^{T}{\Gamma }_{\left(e\right)}^{-1}\overline{e}.$

We can avoid the issue of invertibility of ${\Gamma }_{\left(e\right)}$ by instead of solving the problem $e=Fc$ , we solve the problem $x={F}^{\text{'}}c$ where

${F}^{\text{'}}={A}^{+}F,\phantom{\rule{1.em}{0ex}}{A}^{+}=\phantom{\rule{4.pt}{0ex}}\text{pseudoinverse}\phantom{\rule{4.pt}{0ex}}\text{of}\phantom{\rule{4.pt}{0ex}}A.$

Our problem then is

$\left[{F}^{\text{'}T},{\Gamma }_{\left(x\right)}^{-1},{F}^{\text{'}}\right]c={F}^{\text{'}T}{\Gamma }_{\left(x\right)}^{-1}\overline{x},$

where

$\overline{x}=\frac{1}{N}\sum _{j=1}^{N}{x}_{j}.$

However we see that even if F is nonsingular ${F}^{\text{'}}={A}^{+}F$ is singular, and our problem is not avoided.

## Finding optimal force vector

Setting up our problem with the equation $e=Fc$ (see "Rewriting the Problem" ) helps us see an important realization. Because F is diagonal,

$e=\left[\begin{array}{c}{e}_{1}\\ {e}_{2}\\ ⋮\\ {e}_{n-1}\\ {e}_{n}\end{array}\right]=\left[\begin{array}{c}{F}_{1,1}{c}_{1}\\ {F}_{2,2}{c}_{2}\\ ⋮\\ {F}_{n-1,n-1}{c}_{n-1}\\ {F}_{n,n}{c}_{n}\end{array}\right].$

Thus assuming ${F}_{i,i}\ne 0$ ,

${c}_{i}=\frac{{e}_{i}}{{F}_{i,i}}\phantom{\rule{1.em}{0ex}}\text{or,}\phantom{\rule{1.em}{0ex}}{k}_{i}=\frac{1}{{c}_{i}}=\frac{{F}_{i,i}}{{e}_{i}}.$

This formulation helps us see another important realization. Namely the importance of ${F}_{i,i}\ne 0$ . Recall that $F=\text{diag}\left({A}^{-T}f\right)$ . We have control over the f we choose, so it would be wise to choose an f so that ${A}^{-T}f$ has no zero elements. This happens only if every row of ${A}^{-T}$ is not orthogonal to f . We would like to choose an f that had as many zero elements as possible, but also is not orthogonal to any of the rows of ${A}^{-T}$ . We can formulate our search for an optimal f into the optimization problem,

$\text{min}\phantom{\rule{1.em}{0ex}}{f}^{T}f+\gamma \frac{1}{\delta +\text{min}\left(\left|{A}^{-T},f\right|\right)},$

where γ and δ are adjustable parameters to get the best result. Because of the unsmooth nature of this minimization problem, this is best solved using MATLAB's fminsearch function.

In some networks we may have limitations on the f that we choose. For example in our original network

${f}_{1}={f}_{6}={f}_{7}={f}_{8}={f}_{10}={f}_{13}=0$

for every f that we choose. In the case that ${f}_{j}=0$ , we can rewrite our optimization problem to

$\text{min}\phantom{\rule{1.em}{0ex}}{f}^{\text{'}T}{f}^{\text{'}}+\gamma \frac{1}{\delta +\text{min}\left(\left|{A}^{\text{'}},{f}^{\text{'}}\right|\right)},$

where

${A}^{\text{'}}=\left[\begin{array}{cccccc}{A}_{1}^{-T}& \cdots & {A}_{j-1}^{-T}& {A}_{j+1}^{-T}& \cdots & {A}_{n}^{-T}\end{array}\right],\phantom{\rule{1.em}{0ex}}{A}_{i}^{-T}=\text{the}\phantom{\rule{4.pt}{0ex}}i\text{th}\phantom{\rule{4.pt}{0ex}}\text{column}\phantom{\rule{4.pt}{0ex}}\text{of}\phantom{\rule{4.pt}{0ex}}{A}^{-T},$

and

${f}^{\text{'}}=\left[\begin{array}{c}{f}_{1}\\ ⋮\\ {f}_{j-1}\\ {f}_{j+1}\\ ⋮\\ {f}_{n}\end{array}\right].$

Using these methods, we found optimal f 's using MATLAB's fminsearch function on simulated data from small simple spring networks. In every network the A matrix was square and invertible. We tested networks having 2, 4, 6, and 8 springs. In each case our initial force vector was a perfectly reasonable guess that gave incomplete solutions for the spring constants. However when we inputted that initial force vector into fminsearch , the output was a force vector that made physical sense and gave accurate solutions for the spring constants.

## Further research

There are two main areas of further research that directly follow the research presented in this paper. One is applying the maximum likelihood estimate approach to spring systems having a singular A matrix. We saw in "Problems with Maximum Likelihood Estimate Approach" the problems we ran into when we applied the statistical technique to a system with a singular A matrix. But this problem is expected due to the underdetermined nature of the problem (see "An Inverse Problem" ). We dealt with that problem by stacking originally, so further research could be done in using the statistical approach and stacking.

The other area for further research is in optimizing the f vector (see "Finding Optimal Force Vector" ). Further work could be done on tweaking the minimization problem so that the optimal f can be found for larger networks and networks with more restrictions on f . Also, if our system is underdetermined then even an optimal f won't give us a complete solution without stacking. So more research could be done in trying to find a set of optimal f 's that, when stacked, give the most accurate and complete solutions.

## Acknowledgements

We would like to thank Dr. Steven Cox and Dr. Mark Embree for their guidance, as well as Dr. Derek Hansen and Jeffrey Hokanson for their help and support.

This Connexions module describes work conducted as part of Rice University's VIGRE program, supported by National Science Foundationgrant DMS–0739420.

Pfieffer, P. Pfieffer Applied Probability. Connexions.org.

Cox, S. CAAM 335: Course Notes. www.caam.rice.edu.http://www.caam.rice.edu/ cox/main.pdf

Cox, S., Embree, M.,&Hokanson, J. CAAM 335: Lab Manual.

www.caam.rice.edu.http://www.caam.rice.edu/ caam335lab/labman.pdf

#### Questions & Answers

how do they get the third part x = (32)5/4
can someone help me with some logarithmic and exponential equations.
sure. what is your question?
20/(×-6^2)
Salomon
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
Salomon
I'm not sure why it wrote it the other way
Salomon
I got X =-6
Salomon
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
Commplementary angles
hello
Sherica
im all ears I need to learn
Sherica
right! what he said ⤴⤴⤴
Tamia
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
a perfect square v²+2v+_
kkk nice
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
or infinite solutions?
Kim
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Al
y=10×
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
rolling four fair dice and getting an even number an all four dice
Kristine 2*2*2=8
Differences Between Laspeyres and Paasche Indices
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
is it 3×y ?
J, combine like terms 7x-4y
how do you translate this in Algebraic Expressions
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!