Is it useful to convert a higher order PDE into a 1st order system?
$begingroup$
I just learned how a higher order PDE can be converted into a system of PDEs.I am just wondering whether this is a standard way to solve some higher order PDEs which are immune to other methods or is it more efficient?
pde linear-pde parabolic-pde
$endgroup$
add a comment |
$begingroup$
I just learned how a higher order PDE can be converted into a system of PDEs.I am just wondering whether this is a standard way to solve some higher order PDEs which are immune to other methods or is it more efficient?
pde linear-pde parabolic-pde
$endgroup$
add a comment |
$begingroup$
I just learned how a higher order PDE can be converted into a system of PDEs.I am just wondering whether this is a standard way to solve some higher order PDEs which are immune to other methods or is it more efficient?
pde linear-pde parabolic-pde
$endgroup$
I just learned how a higher order PDE can be converted into a system of PDEs.I am just wondering whether this is a standard way to solve some higher order PDEs which are immune to other methods or is it more efficient?
pde linear-pde parabolic-pde
pde linear-pde parabolic-pde
edited Jan 23 at 13:53
ben tenyson
asked Jan 23 at 13:28
ben tenysonben tenyson
414
414
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
In addition to @GiuseppeNegro's answer, it has several advantages to convert a high-order PDE into a first-order system, e.g. a system of the form $boldsymbol{u}_t + boldsymbol{f}(boldsymbol{u})_x = boldsymbol{r}(boldsymbol{u})$.
- For some particular linear hyperbolic systems, we may be able to decouple the equations, so that the method of characteristics can be used to solve initial- and boundary-value problems.
- For some particular hyperbolic systems, we may be able to derive an analytical solution to the Riemann problem (a particular initial-value problem).
- We may be able to exploit theoretical results available for this kind of system (existence, uniqueness, smoothness).
- We can make use of well-suited numerical methods, such as finite-volume methods of Godunov type.
However, not every higher-order PDE can be written in the previous form.
$endgroup$
add a comment |
$begingroup$
This is connected to the Hamiltonian formalism, and is also done in PDEs sometimes. I am far from being an expert, so let me just present the case of the wave equation $u_{tt} = Delta u$. Introduce the two-component vector (position-momentum):
$$
boldsymbol{u}:=begin{bmatrix} u \ u_tend{bmatrix}.$$
Then the wave equation is rewritten as
$$
partial_t boldsymbol{u} = J H boldsymbol{u},qquad J=begin{bmatrix} 0 & 1 \ -1 & 0 end{bmatrix}, qquad H=begin{bmatrix} -Delta & 0 \ 0 & 1 end{bmatrix}.$$
Is this useful? Well, to begin with, it lets the abstract theory of semigroups come into play. (That theory is the generalization to the infinite-dimensional case of the equation $dot{x}= A x$, where $A$ is replaced with a linear operator on some Banach space). It also reveals a conservation law; if $boldsymbol{u}$ solves the wave equation then
$$
begin{split}
partial_t langle Hboldsymbol{u}(t), boldsymbol{u}(t)rangle &= langle HJHboldsymbol{u}| boldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle \ &= -langle Hboldsymbol{u}|JHboldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle =0,
end{split}
$$
where
$$
langle (f_1, g_1) |(f_2, g_2)rangle:= int f_1f_2 + int g_1g_2,$$
and where we used the fact that $H$ is a symmetric operator, while $J$ is an anti-symmetric one. We have thus shown that
$$
langle H boldsymbol{u}|boldsymbol{u}rangle=int -Delta u, u + int u_t^2
$$
is constant along the wave flow, which is a fundamental fact known as conservation of energy. (The first summand equals $int |nabla u|^2$, which is how it usually appears).
This is all very basic, but already shows that, sometimes, this kind of manipulation can be useful.
$endgroup$
add a comment |
$begingroup$
It's not clear to me how this would work for PDE's. For ODE's:
Yes, any higher-order ODE is equivalent to a system of first-order ODE's. For example $$y''=f(y,y',t)$$is equivalent to the system $$y_1'=y_2, y_2'=f(y_1,y_2,t).$$I don't know that this is important for solving ODE's, but it's certainly useful in proving things about them. Because that system of two ODE"s is just $$Y'=F(Y,t)$$for a suitable $F$, where $Y=(y_1,y_2)$. Proofs of things for ODE's often work just as well for "vector-valued" ODE's, which then have corollaries for higher-order (scalar-valued) ODE's. Hmm, I suppose the same holds for numerical methods for approximate solutions.
$endgroup$
$begingroup$
They do this in evolution PDEs also, when they are interpreted as infinite-dimensional ODEs. (It can get messy, though...)
$endgroup$
– Giuseppe Negro
Jan 23 at 15:46
$begingroup$
This downvote (without explanation) is unfair. The question has been substantially edited after this answer.
$endgroup$
– Giuseppe Negro
Jan 23 at 18:42
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084470%2fis-it-useful-to-convert-a-higher-order-pde-into-a-1st-order-system%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
In addition to @GiuseppeNegro's answer, it has several advantages to convert a high-order PDE into a first-order system, e.g. a system of the form $boldsymbol{u}_t + boldsymbol{f}(boldsymbol{u})_x = boldsymbol{r}(boldsymbol{u})$.
- For some particular linear hyperbolic systems, we may be able to decouple the equations, so that the method of characteristics can be used to solve initial- and boundary-value problems.
- For some particular hyperbolic systems, we may be able to derive an analytical solution to the Riemann problem (a particular initial-value problem).
- We may be able to exploit theoretical results available for this kind of system (existence, uniqueness, smoothness).
- We can make use of well-suited numerical methods, such as finite-volume methods of Godunov type.
However, not every higher-order PDE can be written in the previous form.
$endgroup$
add a comment |
$begingroup$
In addition to @GiuseppeNegro's answer, it has several advantages to convert a high-order PDE into a first-order system, e.g. a system of the form $boldsymbol{u}_t + boldsymbol{f}(boldsymbol{u})_x = boldsymbol{r}(boldsymbol{u})$.
- For some particular linear hyperbolic systems, we may be able to decouple the equations, so that the method of characteristics can be used to solve initial- and boundary-value problems.
- For some particular hyperbolic systems, we may be able to derive an analytical solution to the Riemann problem (a particular initial-value problem).
- We may be able to exploit theoretical results available for this kind of system (existence, uniqueness, smoothness).
- We can make use of well-suited numerical methods, such as finite-volume methods of Godunov type.
However, not every higher-order PDE can be written in the previous form.
$endgroup$
add a comment |
$begingroup$
In addition to @GiuseppeNegro's answer, it has several advantages to convert a high-order PDE into a first-order system, e.g. a system of the form $boldsymbol{u}_t + boldsymbol{f}(boldsymbol{u})_x = boldsymbol{r}(boldsymbol{u})$.
- For some particular linear hyperbolic systems, we may be able to decouple the equations, so that the method of characteristics can be used to solve initial- and boundary-value problems.
- For some particular hyperbolic systems, we may be able to derive an analytical solution to the Riemann problem (a particular initial-value problem).
- We may be able to exploit theoretical results available for this kind of system (existence, uniqueness, smoothness).
- We can make use of well-suited numerical methods, such as finite-volume methods of Godunov type.
However, not every higher-order PDE can be written in the previous form.
$endgroup$
In addition to @GiuseppeNegro's answer, it has several advantages to convert a high-order PDE into a first-order system, e.g. a system of the form $boldsymbol{u}_t + boldsymbol{f}(boldsymbol{u})_x = boldsymbol{r}(boldsymbol{u})$.
- For some particular linear hyperbolic systems, we may be able to decouple the equations, so that the method of characteristics can be used to solve initial- and boundary-value problems.
- For some particular hyperbolic systems, we may be able to derive an analytical solution to the Riemann problem (a particular initial-value problem).
- We may be able to exploit theoretical results available for this kind of system (existence, uniqueness, smoothness).
- We can make use of well-suited numerical methods, such as finite-volume methods of Godunov type.
However, not every higher-order PDE can be written in the previous form.
edited Jan 23 at 16:30
answered Jan 23 at 16:24
Harry49Harry49
7,52431341
7,52431341
add a comment |
add a comment |
$begingroup$
This is connected to the Hamiltonian formalism, and is also done in PDEs sometimes. I am far from being an expert, so let me just present the case of the wave equation $u_{tt} = Delta u$. Introduce the two-component vector (position-momentum):
$$
boldsymbol{u}:=begin{bmatrix} u \ u_tend{bmatrix}.$$
Then the wave equation is rewritten as
$$
partial_t boldsymbol{u} = J H boldsymbol{u},qquad J=begin{bmatrix} 0 & 1 \ -1 & 0 end{bmatrix}, qquad H=begin{bmatrix} -Delta & 0 \ 0 & 1 end{bmatrix}.$$
Is this useful? Well, to begin with, it lets the abstract theory of semigroups come into play. (That theory is the generalization to the infinite-dimensional case of the equation $dot{x}= A x$, where $A$ is replaced with a linear operator on some Banach space). It also reveals a conservation law; if $boldsymbol{u}$ solves the wave equation then
$$
begin{split}
partial_t langle Hboldsymbol{u}(t), boldsymbol{u}(t)rangle &= langle HJHboldsymbol{u}| boldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle \ &= -langle Hboldsymbol{u}|JHboldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle =0,
end{split}
$$
where
$$
langle (f_1, g_1) |(f_2, g_2)rangle:= int f_1f_2 + int g_1g_2,$$
and where we used the fact that $H$ is a symmetric operator, while $J$ is an anti-symmetric one. We have thus shown that
$$
langle H boldsymbol{u}|boldsymbol{u}rangle=int -Delta u, u + int u_t^2
$$
is constant along the wave flow, which is a fundamental fact known as conservation of energy. (The first summand equals $int |nabla u|^2$, which is how it usually appears).
This is all very basic, but already shows that, sometimes, this kind of manipulation can be useful.
$endgroup$
add a comment |
$begingroup$
This is connected to the Hamiltonian formalism, and is also done in PDEs sometimes. I am far from being an expert, so let me just present the case of the wave equation $u_{tt} = Delta u$. Introduce the two-component vector (position-momentum):
$$
boldsymbol{u}:=begin{bmatrix} u \ u_tend{bmatrix}.$$
Then the wave equation is rewritten as
$$
partial_t boldsymbol{u} = J H boldsymbol{u},qquad J=begin{bmatrix} 0 & 1 \ -1 & 0 end{bmatrix}, qquad H=begin{bmatrix} -Delta & 0 \ 0 & 1 end{bmatrix}.$$
Is this useful? Well, to begin with, it lets the abstract theory of semigroups come into play. (That theory is the generalization to the infinite-dimensional case of the equation $dot{x}= A x$, where $A$ is replaced with a linear operator on some Banach space). It also reveals a conservation law; if $boldsymbol{u}$ solves the wave equation then
$$
begin{split}
partial_t langle Hboldsymbol{u}(t), boldsymbol{u}(t)rangle &= langle HJHboldsymbol{u}| boldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle \ &= -langle Hboldsymbol{u}|JHboldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle =0,
end{split}
$$
where
$$
langle (f_1, g_1) |(f_2, g_2)rangle:= int f_1f_2 + int g_1g_2,$$
and where we used the fact that $H$ is a symmetric operator, while $J$ is an anti-symmetric one. We have thus shown that
$$
langle H boldsymbol{u}|boldsymbol{u}rangle=int -Delta u, u + int u_t^2
$$
is constant along the wave flow, which is a fundamental fact known as conservation of energy. (The first summand equals $int |nabla u|^2$, which is how it usually appears).
This is all very basic, but already shows that, sometimes, this kind of manipulation can be useful.
$endgroup$
add a comment |
$begingroup$
This is connected to the Hamiltonian formalism, and is also done in PDEs sometimes. I am far from being an expert, so let me just present the case of the wave equation $u_{tt} = Delta u$. Introduce the two-component vector (position-momentum):
$$
boldsymbol{u}:=begin{bmatrix} u \ u_tend{bmatrix}.$$
Then the wave equation is rewritten as
$$
partial_t boldsymbol{u} = J H boldsymbol{u},qquad J=begin{bmatrix} 0 & 1 \ -1 & 0 end{bmatrix}, qquad H=begin{bmatrix} -Delta & 0 \ 0 & 1 end{bmatrix}.$$
Is this useful? Well, to begin with, it lets the abstract theory of semigroups come into play. (That theory is the generalization to the infinite-dimensional case of the equation $dot{x}= A x$, where $A$ is replaced with a linear operator on some Banach space). It also reveals a conservation law; if $boldsymbol{u}$ solves the wave equation then
$$
begin{split}
partial_t langle Hboldsymbol{u}(t), boldsymbol{u}(t)rangle &= langle HJHboldsymbol{u}| boldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle \ &= -langle Hboldsymbol{u}|JHboldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle =0,
end{split}
$$
where
$$
langle (f_1, g_1) |(f_2, g_2)rangle:= int f_1f_2 + int g_1g_2,$$
and where we used the fact that $H$ is a symmetric operator, while $J$ is an anti-symmetric one. We have thus shown that
$$
langle H boldsymbol{u}|boldsymbol{u}rangle=int -Delta u, u + int u_t^2
$$
is constant along the wave flow, which is a fundamental fact known as conservation of energy. (The first summand equals $int |nabla u|^2$, which is how it usually appears).
This is all very basic, but already shows that, sometimes, this kind of manipulation can be useful.
$endgroup$
This is connected to the Hamiltonian formalism, and is also done in PDEs sometimes. I am far from being an expert, so let me just present the case of the wave equation $u_{tt} = Delta u$. Introduce the two-component vector (position-momentum):
$$
boldsymbol{u}:=begin{bmatrix} u \ u_tend{bmatrix}.$$
Then the wave equation is rewritten as
$$
partial_t boldsymbol{u} = J H boldsymbol{u},qquad J=begin{bmatrix} 0 & 1 \ -1 & 0 end{bmatrix}, qquad H=begin{bmatrix} -Delta & 0 \ 0 & 1 end{bmatrix}.$$
Is this useful? Well, to begin with, it lets the abstract theory of semigroups come into play. (That theory is the generalization to the infinite-dimensional case of the equation $dot{x}= A x$, where $A$ is replaced with a linear operator on some Banach space). It also reveals a conservation law; if $boldsymbol{u}$ solves the wave equation then
$$
begin{split}
partial_t langle Hboldsymbol{u}(t), boldsymbol{u}(t)rangle &= langle HJHboldsymbol{u}| boldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle \ &= -langle Hboldsymbol{u}|JHboldsymbol{u}rangle + langle Hboldsymbol{u}|JHboldsymbol{u}rangle =0,
end{split}
$$
where
$$
langle (f_1, g_1) |(f_2, g_2)rangle:= int f_1f_2 + int g_1g_2,$$
and where we used the fact that $H$ is a symmetric operator, while $J$ is an anti-symmetric one. We have thus shown that
$$
langle H boldsymbol{u}|boldsymbol{u}rangle=int -Delta u, u + int u_t^2
$$
is constant along the wave flow, which is a fundamental fact known as conservation of energy. (The first summand equals $int |nabla u|^2$, which is how it usually appears).
This is all very basic, but already shows that, sometimes, this kind of manipulation can be useful.
answered Jan 23 at 15:30
Giuseppe NegroGiuseppe Negro
17.4k332126
17.4k332126
add a comment |
add a comment |
$begingroup$
It's not clear to me how this would work for PDE's. For ODE's:
Yes, any higher-order ODE is equivalent to a system of first-order ODE's. For example $$y''=f(y,y',t)$$is equivalent to the system $$y_1'=y_2, y_2'=f(y_1,y_2,t).$$I don't know that this is important for solving ODE's, but it's certainly useful in proving things about them. Because that system of two ODE"s is just $$Y'=F(Y,t)$$for a suitable $F$, where $Y=(y_1,y_2)$. Proofs of things for ODE's often work just as well for "vector-valued" ODE's, which then have corollaries for higher-order (scalar-valued) ODE's. Hmm, I suppose the same holds for numerical methods for approximate solutions.
$endgroup$
$begingroup$
They do this in evolution PDEs also, when they are interpreted as infinite-dimensional ODEs. (It can get messy, though...)
$endgroup$
– Giuseppe Negro
Jan 23 at 15:46
$begingroup$
This downvote (without explanation) is unfair. The question has been substantially edited after this answer.
$endgroup$
– Giuseppe Negro
Jan 23 at 18:42
add a comment |
$begingroup$
It's not clear to me how this would work for PDE's. For ODE's:
Yes, any higher-order ODE is equivalent to a system of first-order ODE's. For example $$y''=f(y,y',t)$$is equivalent to the system $$y_1'=y_2, y_2'=f(y_1,y_2,t).$$I don't know that this is important for solving ODE's, but it's certainly useful in proving things about them. Because that system of two ODE"s is just $$Y'=F(Y,t)$$for a suitable $F$, where $Y=(y_1,y_2)$. Proofs of things for ODE's often work just as well for "vector-valued" ODE's, which then have corollaries for higher-order (scalar-valued) ODE's. Hmm, I suppose the same holds for numerical methods for approximate solutions.
$endgroup$
$begingroup$
They do this in evolution PDEs also, when they are interpreted as infinite-dimensional ODEs. (It can get messy, though...)
$endgroup$
– Giuseppe Negro
Jan 23 at 15:46
$begingroup$
This downvote (without explanation) is unfair. The question has been substantially edited after this answer.
$endgroup$
– Giuseppe Negro
Jan 23 at 18:42
add a comment |
$begingroup$
It's not clear to me how this would work for PDE's. For ODE's:
Yes, any higher-order ODE is equivalent to a system of first-order ODE's. For example $$y''=f(y,y',t)$$is equivalent to the system $$y_1'=y_2, y_2'=f(y_1,y_2,t).$$I don't know that this is important for solving ODE's, but it's certainly useful in proving things about them. Because that system of two ODE"s is just $$Y'=F(Y,t)$$for a suitable $F$, where $Y=(y_1,y_2)$. Proofs of things for ODE's often work just as well for "vector-valued" ODE's, which then have corollaries for higher-order (scalar-valued) ODE's. Hmm, I suppose the same holds for numerical methods for approximate solutions.
$endgroup$
It's not clear to me how this would work for PDE's. For ODE's:
Yes, any higher-order ODE is equivalent to a system of first-order ODE's. For example $$y''=f(y,y',t)$$is equivalent to the system $$y_1'=y_2, y_2'=f(y_1,y_2,t).$$I don't know that this is important for solving ODE's, but it's certainly useful in proving things about them. Because that system of two ODE"s is just $$Y'=F(Y,t)$$for a suitable $F$, where $Y=(y_1,y_2)$. Proofs of things for ODE's often work just as well for "vector-valued" ODE's, which then have corollaries for higher-order (scalar-valued) ODE's. Hmm, I suppose the same holds for numerical methods for approximate solutions.
answered Jan 23 at 15:03
David C. UllrichDavid C. Ullrich
61.2k43994
61.2k43994
$begingroup$
They do this in evolution PDEs also, when they are interpreted as infinite-dimensional ODEs. (It can get messy, though...)
$endgroup$
– Giuseppe Negro
Jan 23 at 15:46
$begingroup$
This downvote (without explanation) is unfair. The question has been substantially edited after this answer.
$endgroup$
– Giuseppe Negro
Jan 23 at 18:42
add a comment |
$begingroup$
They do this in evolution PDEs also, when they are interpreted as infinite-dimensional ODEs. (It can get messy, though...)
$endgroup$
– Giuseppe Negro
Jan 23 at 15:46
$begingroup$
This downvote (without explanation) is unfair. The question has been substantially edited after this answer.
$endgroup$
– Giuseppe Negro
Jan 23 at 18:42
$begingroup$
They do this in evolution PDEs also, when they are interpreted as infinite-dimensional ODEs. (It can get messy, though...)
$endgroup$
– Giuseppe Negro
Jan 23 at 15:46
$begingroup$
They do this in evolution PDEs also, when they are interpreted as infinite-dimensional ODEs. (It can get messy, though...)
$endgroup$
– Giuseppe Negro
Jan 23 at 15:46
$begingroup$
This downvote (without explanation) is unfair. The question has been substantially edited after this answer.
$endgroup$
– Giuseppe Negro
Jan 23 at 18:42
$begingroup$
This downvote (without explanation) is unfair. The question has been substantially edited after this answer.
$endgroup$
– Giuseppe Negro
Jan 23 at 18:42
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084470%2fis-it-useful-to-convert-a-higher-order-pde-into-a-1st-order-system%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown