Commit 23a2220b authored by Andre Heydt's avatar Andre Heydt
Browse files

utf8 type removed

git-svn-id: https://svn.math.tu-berlin.de/svn/jtem@1745 f5b180c5-49ee-4939-b20e-b6ed35f0f7b7
parent 13bb7179
......@@ -32,7 +32,7 @@ OF SUCH DAMAGE.
package de.jtem.numericalMethods.algebra.linear.solve;
/**
* Computes for a system of equations L·X=B with given left triangular matrix
* Computes for a system of equations LX=B with given left triangular matrix
* L and matrix B the solving matrix X.
* <p />
* This algorithm is implemented for both real and complex valued equation
......@@ -46,7 +46,7 @@ package de.jtem.numericalMethods.algebra.linear.solve;
* not changing any arguments where not expected.
* But this version can sometimes be very resource consuming!
* <p />
* Method versions for L·x=b:
* Method versions for Lx=b:
* <blockquote>
* <table border="2" cellpadding="6">
* <tr>
......@@ -64,7 +64,7 @@ package de.jtem.numericalMethods.algebra.linear.solve;
* </tr>
* </table>
* </blockquote>
* Method versions for L·X=B:
* Method versions for LX=B:
* <blockquote>
* <table border="2" cellpadding="6">
* <tr>
......
......@@ -32,7 +32,7 @@ OF SUCH DAMAGE.
package de.jtem.numericalMethods.algebra.linear.solve;
/**
* Computes for a system of equations R·X=B with given right triangular matrix
* Computes for a system of equations RX=B with given right triangular matrix
* R and matrix B the solving matrix X.
* <p />
* This algorithm is implemented for both real and complex valued equation
......@@ -46,7 +46,7 @@ package de.jtem.numericalMethods.algebra.linear.solve;
* not changing any arguments where not expected.
* But this version can sometimes be very resource consuming!
* <p />
* Method versions for R·x=b:
* Method versions for Rx=b:
* <blockquote>
* <table border="2" cellpadding="6">
* <tr>
......@@ -64,7 +64,7 @@ package de.jtem.numericalMethods.algebra.linear.solve;
* </tr>
* </table>
* </blockquote>
* Method versions for R·X=B:
* Method versions for RX=B:
* <blockquote>
* <table border="2" cellpadding="6">
* <tr>
......
......@@ -45,7 +45,7 @@ public final class ComplexLaurentPolynomial {
<code>a_k = aRe[k] + i aIm[k]</code>
and degree <code>degOfA</code> at
<code>z = x + i y</code> and returns the result in <code>aAtZ</code>.
The polynomial is evaluated using Horner´s method.
The polynomial is evaluated using Horners method.
*/
public static void eval( final double [] aRe,
final double [] aIm,
......@@ -96,7 +96,7 @@ public final class ComplexLaurentPolynomial {
<code>a_k = aRe[k + offsetOfA ] + i aIm[k + offsetOfA]</code>
and degree <code>degOfA</code> at
<code>z = x + i y</code> and returns the result in <code>dAAtZ</code>.
The polynomial is evaluated using Horner´s method. */
The polynomial is evaluated using Horner�s method. */
public static void evalDerivative( final double [] aRe,
final double [] aIm,
final int lowerDegOfA, final int degOfA, final int n,
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment