 | Finished writing a draft article? Are you ready to request review of it by an experienced editor for possible inclusion in Wikipedia? Submit your draft for review! |
Consider a solid body subjected to a pair of external force systems, referred to as
and
. Consider that each force system causes a displacement fields, with the displacements measured at the external force's point of application referred to as
and
.
When the
force system is applied to the structure, the balance between the work performed by the external force system and the strain energy is:

The work-energy balance associated with the
force system is as follows:

Now, consider that with the
force system applied, the
force system is applied subsequently. As the
is already applied and therefore won't cause any extra displacement, the work-energy balance assumes the following expression:

Conversely, if we consider the
force system already applied and the
external force system applied subsequently, the work-energy balance will assume the following expression:

If the work-energy balance for the cases where the external force systems are applied in isolation are respectively subtracted from the cases where the force systems are applied simultaneously, we arrive at the following equations:


If the solid body where the force systems are applied is formed by a linear elastic material and if the force systems are such that only infinitesimal strains are observed in the body, then the body's constitutive equation, which may follow Hooke's law, can be expressed in the following manner:

Replacing this result in the previous set of equations leads us to the following result:


If we subtracting both equations then we obtain the following result:

Consider a solid body subjected to a pair of external force systems, referred to as
and
. Consider that each force system causes a displacement fields, with the displacements measured at the external force's point of application referred to as
and
.
When the
force system is applied to the structure, the balance between the work performed by the external force system and the strain energy is:

The work-energy balance associated with the
force system is as follows:

Now, consider that with the
force system applied, very small
force system is applied subsequently. As the
is already applied and therefore won't cause any extra displacement, the work-energy balance assumes the following expression:

Conversely, if we consider the
force system already applied and very small
external force system applied subsequently, the work-energy balance will assume the following expression:

If the work-energy balance for the cases where the external force systems are applied in isolation are respectively subtracted from the cases where the force systems are applied simultaneously, we arrive at the following equations:


If the solid body where the force systems are applied is formed by a linear elastic material and if the force systems are such that only infinitesimal strains are observed in the body, then the body's constitutive equation, which may follow Hooke's law, can be expressed in the following manner:

Replacing this result in the previous set of equations leads us to the following result:


If we subtracting both equations then we obtain the following result:

Triangle centers can be written as following

Here,
are position vectors, and, coordinates
are scalars whose definition corresponds each center instances can be seen in the following table, where,
are side lengths, and,
is area of the triangle that Heron's formula can be utilized to get.
|
|
|
|
|
Incenter
|
|
|
|
|
Excenter
|
|
|
|
|
|
|
|
|
|
|
|
|
Centroid
|
|
|
|
|
Circumcenter
|
|
|
|
|
Orthocenter
|
|
|
|
|




三角形五心 (重心、内心、傍心、外心、垂心) の位置ベクトル
は、頂点の位置ベクトル
を用いて、一般式

で記述される。
は、次の表に整理される重みである。
はヘロンの公式でも得られる三角形の面積。
|
|
|
|
|
内心
|
|
|
|
|
外心
|
|
|
|
|
垂心
|
|
|
|
|
重心
|
|
|
|
|
傍心
|
|
|
|
|
|
|
|
|
|
|
|
|




Cartesian Derivation
[edit]
Triangle centers can be written as following

Here,
are coordinates whose definition corresponds each center. Several examples for major centers can be seen in the following table.
|
|
|
|
|
Incenter
|
|
|
|
|
Excenter
|
|
|
|
|
|
|
|
|
|
|
|
|
Centroid
|
|
|
|
|
Circumcenter
|
|
|
|
|
Orthocenter
|
|
|
|
|






Such derivation is most convenient when triangles are defined by three vertices. As, triangles also can be defined by three (infinite) "lines", there exists another approach. In such cases, trilinear coordinates stated in another section may supply a better means.
Monomial: Although there can be a small ambiguity in the term monomial(see that section), here, it is defined as a product of nonzero constant called coefficient and no or several variables. In case coefficient is
and variable(s) exist,
can be omitted. Duplication on variables is allowed, so,
and
are monomials(
and
are coefficients, and
,
,
,
are variables).
Polynomial: It is a sum of several terms. In special cases, monomial itself may be included.
in the following form is a polynomial where every
is monomial,

Domain of polynomial: In the latest definition of polynomial
, if every
is in a domain(complex, real, integer), then
can be called in that domain. For example,
has only integer factors, so, it is in an integer domain and can be called an integer polynomial. On the other hand,
is not an integer polynomial.
Factor(of polynomials): If polynomial
can be a product of several other polynomials
, every
is a factor of
, and in other words,
is factorized into
,

Domain in Factorization: Domain in factorization is a domain a polynomial's factors(each of them itself is a polynomial) shall be in. If all the factor is in some small domain, product
shall be in the same or a smaller domain, so, domain in factorization may be comparably larger than that of
. Sometimes polynomial
might accidentally be in a small domain, domain in factorization should be assigned beforehand.
Univariant: It is a class of polynomials with a single variable (intermediate).
is univariant, and
is not.
Selection of a Field(or a Domain of Factorization)
[edit]
In this section, univariant cases are mainly studied.
Factorizing a polynomial
has a close relation with solving value(s) of its variable that satisfy
. It is especially so in univariant polynomial cases(variable is
only, for example).
In an usual meaning, it is a largest sized domain. It is also smartest because for a polynomial of order n, dividing into n time product of degree 1 factors is always assured.
Let
be coefficients, polynomial
can be factorized into irreducible factors as
.
If
equals one of
, one of terms in rightest side above will be zero(so
). If
equals neither of
,
can not be zero. That's why, each of
must be a solution of
, and simultaneously, each solution
of
must be included in the list
. This means
are the set of polynomial
's solution.
To show examples of such a factorization, following is an example,

As, real number is a subset of complex number, polynomial of real number domain can be factorized into complex number factors as above. Although, if real number domain is preferred, it can be factorized into utmost degree 2 real domain factors as following,
.
Here, all of
,
, and
are real.
To show examples of such a factorization, following are examples,


Polynomials of rational number domain is factorized into rational number factors as the following.

This case might have just small importance, because, if lcm of mother numbers is multiplied to both sides, it will be transformed into integer domain problem as the following

As, integer is a subset of real number, polynomial of integer domain can be factorized into either real or complex number factors. Although, if integer domain is preferred as factors, such a restriction is sometimes possible, however, there is no assurance on solution's existence. As an example,
cannot be factorized except its original form if real domain is ordered for target factor(s).
To solve a problem of integer domain problems, hand calculation can be used, because it is just find a solution among finite candidates.
If you have a computer means to solve real or complex problem, another way is to utilize them, and next, just pick up or multiply some into integer domain factors.
In days prior to computers were widely used, factorizing polynomials in finite steps was regarded especially important and studied. Such ways are not adequate for general cases. For example, in the following equations


all factors in a expanded form(left sides) are rational, while factors for terms within each bracket(of right sides) might be not. Actually, irrational numbers cannot be calculated(nor expressed) accurately in finite steps. Following is a method to find a solution within finite number of candidates; valid in cases factors are known to be rational(ex. prepared by a teacher).
"Integer polynomials must factor into integer polynomial factors"(in "Kronecker's method")
[edit]
Quiz: In most cases, the following polynomial

can be decomposed into such a form

However, in some cases, it doesn't work. Can you show one of exceptional cases?
Answer: Like

Because as "integer polynomials must factor into integer polynomial factors", decomposing into

is inhibited.
But, is the answer right? Opinions requested.
|
|
|
|
|
|
|
Incenter
|
|
|
|
|
|
Orthocenter
|
|
|
|
|



|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Application to finding repeated factors
[edit]
To get a root
that satisfies
of a factorial polynomial as

where
is the quotient polynomial, it is irritating if answer has not enough accuracy that the system usually assures.
It is conspicuous when '
' above is one of famous numbers(integers, rational numbers, analytic numbers(like
)).
Actually, to find a root of
,
by
, some sort of repetitive methods (for example Newton-Raphson) is necessary to solve the root.
A simple repetitive method is enough if
, however, just small accuracy is expected in multiple root cases.
One example is
.
In procedure of a repetitive method, '
' relatively close to the accurate value(say
) gives
a result very close to zero (
).
So, using value of
itself is not an ideal way to seek the zero point of '
'.
In a expectation that, although different roots might have the same value(multiple roots), roots of different values shall not be close, using formal derivative is effective to get a punctual value of '
'.
The second derivative of above polynomial is
,
and you can get the root seeking
with a good accuracy.
On the contrary, if roots of very close values exist, it is disguisable. For example
.
Here, the second derivative will be the same as above
,
where small differences
for '
' are neglected.
Thus, using formal derivative is not almighty, however, it assures high probability to get amiable answers in most cases.