All Downloads are FREE. Search and download functionalities are using the official Maven repository.

math.trmm.DtrmmNetlib Maven / Gradle / Ivy

Go to download

Elementary math utilities with a focus on random number generation, non-linear optimization, interpolation and solvers

The newest version!
/*
 * Copyright ? ???? The University of Tennessee. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 * ? Redistributions of source code must retain the above copyright notice, this
 *   list of conditions and the following disclaimer.
 * ? Redistributions in binary form must reproduce the above copyright notice,
 *   this list of conditions and the following disclaimer listed in this license in
 *   the documentation and/or other materials provided with the distribution.
 * ? Neither the name of the copyright holders nor the names of its contributors
 *   may be used to endorse or promote products derived from this software without
 *   specific prior written permission.
 *
 * This software is provided by the copyright holders and contributors "as is" and
 * any express or implied warranties, including, but not limited to, the implied
 * warranties of merchantability and fitness for a particular purpose are disclaimed.
 * In no event shall the copyright owner or contributors be liable for any direct,
 * indirect, incidental, special, exemplary, or consequential damages (including,
 * but not limited to, procurement of substitute goods or services; loss of use,
 * data, or profits; or business interruption) however caused and on any theory of
 * liability, whether in contract, strict liability, or tort (including negligence
 * or otherwise) arising in any way out of the use of this software, even if advised
 * of the possibility of such damage. 
 */
package math.trmm;

/**
 * The original Netlib implementation (which was generated using the F2J
 * translator directly from Fortran 77 into a Java class file). The source code
 * had to be restored from bytecode.
 */
final class DtrmmNetlib {

    static void dtrmm(boolean lside, boolean upper, boolean notrans, boolean nounit, int m, int n, double alpha,
            double[] a, int _a_offset, int lda, double[] b, int _b_offset, int ldb) {

        // Quick return when == alpha zero
        if (alpha == 0.0) {
            int j = 1;
            for (int p = n; p > 0; p--) {
                int i = 1;
                for (int q = m; q > 0; q--) {
                    b[i - 1 + (j - 1) * ldb + _b_offset] = 0.0;
                    i++;
                }

                j++;
            }

            return;
        }
        // Start the operations
        if (lside) {
            if (notrans) {
                if (upper) {
                    // lside, notrans, upper
                    int j = 1;
                    for (int p = n; p > 0; p--) {
                        int k = 1;
                        for (int q = m; q > 0; q--) {
                            if (b[k - 1 + (j - 1) * ldb + _b_offset] != 0.0) {
                                double temp = alpha * b[k - 1 + (j - 1) * ldb + _b_offset];
                                int i = 1;
                                for (int r = k - 1; r > 0; r--) {
                                    b[i - 1 + (j - 1) * ldb + _b_offset] = b[i - 1 + (j - 1) * ldb + _b_offset]
                                            + temp * a[i - 1 + (k - 1) * lda + _a_offset];
                                    i++;
                                }

                                if (nounit) {
                                    temp *= a[k - 1 + (k - 1) * lda + _a_offset];
                                }
                                b[k - 1 + (j - 1) * ldb + _b_offset] = temp;
                            }
                            k++;
                        }

                        j++;
                    }

                } else {
                    // lside, notrans, !upper
                    int j = 1;
                    for (int p = n; p > 0; p--) {
                        int k = m;
                        for (int q = m; q > 0; q--) {
                            if (b[k - 1 + (j - 1) * ldb + _b_offset] != 0.0) {
                                double temp = alpha * b[k - 1 + (j - 1) * ldb + _b_offset];
                                b[k - 1 + (j - 1) * ldb + _b_offset] = temp;
                                if (nounit) {
                                    b[k - 1 + (j - 1) * ldb + _b_offset] = b[k - 1 + (j - 1) * ldb + _b_offset]
                                            * a[k - 1 + (k - 1) * lda + _a_offset];
                                }
                                int i = k + 1;
                                for (int r = m - k; r > 0; r--) {
                                    b[i - 1 + (j - 1) * ldb + _b_offset] = b[i - 1 + (j - 1) * ldb + _b_offset]
                                            + temp * a[i - 1 + (k - 1) * lda + _a_offset];
                                    i++;
                                }

                            }
                            k--;
                        }

                        j++;
                    }

                }
            } else if (upper) {
                // Form B := alpha*A**T*B
                // lside, !notrans, upper
                int j = 1;
                for (int p = n; p > 0; p--) {
                    int i = m;
                    for (int q = m; q > 0; q--) {
                        double temp = b[i - 1 + (j - 1) * ldb + _b_offset];
                        if (nounit) {
                            temp *= a[i - 1 + (i - 1) * lda + _a_offset];
                        }
                        int k = 1;
                        for (int r = i - 1; r > 0; r--) {
                            temp += a[k - 1 + (i - 1) * lda + _a_offset] * b[k - 1 + (j - 1) * ldb + _b_offset];
                            k++;
                        }

                        b[i - 1 + (j - 1) * ldb + _b_offset] = alpha * temp;
                        i--;
                    }

                    j++;
                }

            } else {
                // lside, !notrans, !upper
                int j = 1;
                for (int p = n; p > 0; p--) {
                    int i = 1;
                    for (int q = m; q > 0; q--) {
                        double temp = b[i - 1 + (j - 1) * ldb + _b_offset];
                        if (nounit) {
                            temp *= a[i - 1 + (i - 1) * lda + _a_offset];
                        }
                        int k = i + 1;
                        for (int r = m - i; r > 0; r--) {
                            temp += a[k - 1 + (i - 1) * lda + _a_offset] * b[k - 1 + (j - 1) * ldb + _b_offset];
                            k++;
                        }

                        b[i - 1 + (j - 1) * ldb + _b_offset] = alpha * temp;
                        i++;
                    }

                    j++;
                }

            }
        } else if (notrans) {
            // Form B := alpha*B*A
            // !lside, notrans
            if (upper) {
                // !lside, notrans, upper
                int j = n;
                for (int p = n; p > 0; p--) {
                    double temp = alpha;
                    if (nounit) {
                        temp *= a[j - 1 + (j - 1) * lda + _a_offset];
                    }
                    int i = 1;
                    for (int q = m; q > 0; q--) {
                        b[i - 1 + (j - 1) * ldb + _b_offset] = temp * b[i - 1 + (j - 1) * ldb + _b_offset];
                        i++;
                    }

                    int k = 1;
                    for (int r = j - 1; r > 0; r--) {
                        if (a[k - 1 + (j - 1) * lda + _a_offset] != 0.0) {
                            temp = alpha * a[k - 1 + (j - 1) * lda + _a_offset];
                            int ii = 1;
                            for (int s = m; s > 0; s--) {
                                b[ii - 1 + (j - 1) * ldb + _b_offset] = b[(ii - 1) + (j - 1) * ldb + _b_offset]
                                        + temp * b[ii - 1 + (k - 1) * ldb + _b_offset];
                                ii++;
                            }

                        }
                        k++;
                    }

                    j--;
                }

            } else {
                // !lside, notrans, !upper
                int j = 1;
                for (int p = n; p > 0; p--) {
                    double temp = alpha;
                    if (nounit) {
                        temp *= a[j - 1 + (j - 1) * lda + _a_offset];
                    }
                    int i = 1;
                    for (int q = m; q > 0; q--) {
                        b[i - 1 + (j - 1) * ldb + _b_offset] = temp * b[i - 1 + (j - 1) * ldb + _b_offset];
                        i++;
                    }

                    int k = j + 1;
                    for (int r = n - j; r > 0; r--) {
                        if (a[k - 1 + (j - 1) * lda + _a_offset] != 0.0) {
                            temp = alpha * a[k - 1 + (j - 1) * lda + _a_offset];
                            int ii = 1;
                            for (int s = m; s > 0; s--) {
                                b[ii - 1 + (j - 1) * ldb + _b_offset] = b[ii - 1 + (j - 1) * ldb + _b_offset]
                                        + temp * b[ii - 1 + (k - 1) * ldb + _b_offset];
                                ii++;
                            }

                        }
                        k++;
                    }

                    j++;
                }

            }
        } else if (upper) {
            // Form B := alpha*B*A**T
            // !lside, !notrans, upper
            int k = 1;
            for (int p = n; p > 0; p--) {
                int j = 1;
                for (int q = k - 1; q > 0; q--) {
                    if (a[j - 1 + (k - 1) * lda + _a_offset] != 0.0) {
                        double temp = alpha * a[j - 1 + (k - 1) * lda + _a_offset];
                        int i = 1;
                        for (int r = m; r > 0; r--) {
                            b[i - 1 + (j - 1) * ldb + _b_offset] = b[i - 1 + (j - 1) * ldb + _b_offset]
                                    + temp * b[i - 1 + (k - 1) * ldb + _b_offset];
                            i++;
                        }

                    }
                    j++;
                }

                double temp = alpha;
                if (nounit) {
                    temp *= a[k - 1 + (k - 1) * lda + _a_offset];
                }
                if (temp != 1.0) {
                    int i = 1;
                    for (int s = m; s > 0; s--) {
                        b[i - 1 + (k - 1) * ldb + _b_offset] = temp * b[i - 1 + (k - 1) * ldb + _b_offset];
                        i++;
                    }

                }
                k++;
            }

        } else {
            // !lside, !notrans, !upper
            int k = n;
            for (int p = n; p > 0; p--) {
                int j = k + 1;
                for (int q = n - k; q > 0; q--) {
                    if (a[j - 1 + (k - 1) * lda + _a_offset] != 0.0) {
                        double temp = alpha * a[j - 1 + (k - 1) * lda + _a_offset];
                        int i = 1;
                        for (int r = m; r > 0; r--) {
                            b[i - 1 + (j - 1) * ldb + _b_offset] = b[i - 1 + (j - 1) * ldb + _b_offset]
                                    + temp * b[i - 1 + (k - 1) * ldb + _b_offset];
                            i++;
                        }

                    }
                    j++;
                }

                double temp = alpha;
                if (nounit) {
                    temp *= a[k - 1 + (k - 1) * lda + _a_offset];
                }
                if (temp != 1.0) {
                    int i = 1;
                    for (int s = m; s > 0; s--) {
                        b[i - 1 + (k - 1) * ldb + _b_offset] = temp * b[i - 1 + (k - 1) * ldb + _b_offset];
                        i++;
                    }

                }
                k--;
            }

        }
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy