Module FillMatrix - Revision history

Paulochambel: /* Sponge */

2014-04-22T10:05:46Z

‎Sponge

2014-04-22T10:05:11Z

‎Sponge

2011-11-02T14:04:52Z

‎Sponge

2011-11-02T14:04:30Z

‎Sponge

2011-11-02T14:04:14Z

‎Sponge

2011-11-02T13:55:33Z

‎Sponge

2011-11-02T13:55:18Z

‎Sponge

2011-11-02T13:54:59Z

‎Sponge

2011-11-02T13:54:39Z

‎Sponge

2011-11-02T13:52:54Z

‎Sponge

@@ Line 128: / Line 128: @@
 === Sponge ===
-Creates a matrix of numbers with the size of the domain, constant inside the domain, and varying exponentially near the open-boundary with a width defined by SPONGE_CELLS. Default value of SPONGE_OUT is 1e5 s ~1 day. This value assumes that usually the reference solution has one instant per day. This value should be equal to frequency of the external solution. The default value of SPONGE_CELLS is 10.
+Creates a matrix of numbers with the size of the domain, constant inside the domain, and varying exponentially near the open-boundary with a width defined by SPONGE_CELLS. Default value of '''SPONGE_OUT''' is 1e5 s ~1 day. This value assumes that usually the reference solution has one instant per day.''' This value should be equal to frequency of the external solution'''. The default value of SPONGE_CELLS is 10.
   FILE_IN_TIME          : NONE

@@ Line 128: / Line 128: @@
 === Sponge ===
-Creates a matrix of numbers with the size of the domain, constant inside the domain, and varying exponentially near the open-boundary with a width defined by SPONGE_CELLS. Default value of SPONGE_OUT is 1e5 and default value of SPONGE_CELLS is 10.
+Creates a matrix of numbers with the size of the domain, constant inside the domain, and varying exponentially near the open-boundary with a width defined by SPONGE_CELLS. Default value of SPONGE_OUT is 1e5 s ~1 day. This value assumes that usually the reference solution has one instant per day. This value should be equal to frequency of the external solution. The default value of SPONGE_CELLS is 10.
   FILE_IN_TIME          : NONE

@@ Line 142: / Line 142: @@
 <math>C(i) = b</math> else.
-In particular for i = 1 and for i = N or higher, <math>C(1) = a</math> and <math>C(N^+) = b</math>.
+In particular, for i = 1 and for i = N or higher, <math>C(1) = a</math> and <math>C(N^+) = b</math>.
 == Important notes ==

@@ Line 142: / Line 142: @@
 <math>C(i) = b</math> else.
-In particular for i = 1 and for i = N or higher, <math>C(1) = a</math> and <math>C(N+) = b</math>.
+In particular for i = 1 and for i = N or higher, <math>C(1) = a</math> and <math>C(N^+) = b</math>.
 == Important notes ==

← Older revision		Revision as of 14:04, 2 November 2011
Line 141:		Line 141:

	<math>C(i) = b</math> else.		<math>C(i) = b</math> else.
		+
		+	In particular for i = 1 and for i = N or higher, <math>C(1) = a</math> and <math>C(N+) = b</math>.

	== Important notes ==		== Important notes ==

@@ Line 138: / Line 138: @@
 If '''a''' and '''b''' are respectively the SPONGE_OUT and the DEFAULTVALUE values then, if '''N''' and '''i''' are respectively the SPONGE_CELLS and the distance from the open boundary in unit cells, the sponge algorithm will compute the coefficient '''C(i)''' according to the following formula:
-<math>C(i) = a^{\frac{N-i}{N-1}}b^{\frac{i-1}{N-1}}</math>       if <math> 1 \leq i \leq N</math>
+<math>C(i) = a^{\frac{N-i}{N-1}}b^{\frac{i-1}{N-1}}\quad</math>       if <math> 1 \leq i \leq N</math>
 <math>C(i) = b</math> else.

← Older revision		Revision as of 13:54, 2 November 2011
Line 139:		Line 139:

	<math>C(i) = a^{\frac{N-i}{N-1}}b^{\frac{i-1}{N-1}}</math> if <math> 1 \leq i \leq N</math>		<math>C(i) = a^{\frac{N-i}{N-1}}b^{\frac{i-1}{N-1}}</math> if <math> 1 \leq i \leq N</math>
		+
	<math>C(i) = b</math> else.		<math>C(i) = b</math> else.

@@ Line 136: / Line 136: @@
   SPONGE_CELLS          : 10
-If '''a''' and '''b''' are respectively the SPONGE_OUT and the DEFAULTVALUE values then, if '''N''' and '''i''' are respectively the SPONGE_CELLS and the distance from the open boundary in unit cells, the sponge algorithm will compute the coefficient according to the following formula:
+If '''a''' and '''b''' are respectively the SPONGE_OUT and the DEFAULTVALUE values then, if '''N''' and '''i''' are respectively the SPONGE_CELLS and the distance from the open boundary in unit cells, the sponge algorithm will compute the coefficient '''C(i)''' according to the following formula:
-<math>a^{\frac{N-i}{N-1}}b^{\frac{i-1}{N-1}}</math>
+<math>C(i) = a^{\frac{N-i}{N-1}}b^{\frac{i-1}{N-1}}</math>
 == Important notes ==