C++ orthotope类代码示例

OGeek|极客世界-中国程序员成长平台 › 门户 › 编程› C++›C++教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了C++中orthotope类的典型用法代码示例。如果您正苦于以下问题：C++ orthotope类的具体用法？C++ orthotope怎么用？C++ orthotope使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。

在下文中一共展示了orthotope类的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的C++代码示例。

示例1: write_matrix_to_octave_file

void write_matrix_to_octave_file(
    orthotope<T> const& A
  , std::string const& name
    )
{
    BOOST_ASSERT(2 == A.order());

    std::size_t const rows = A.extent(0);
    std::size_t const cols = A.extent(1);

    std::ofstream file(name + ".mat");

    BOOST_ASSERT(file.is_open());

    file << "# name: " << name << "\n"
         << "# type: matrix\n"
         << "# rows: " << rows << "\n"
         << "# columns: " << cols << "\n";

    for (std::size_t i = 0; i < rows; ++i)
    {
        for (std::size_t j = 0; j < cols; ++j)
        {
            T const v = (compare_floating(0.0, A(i, j), 1e-6) ? 0.0 : A(i, j));
            file << " " << v; 
        }

        file << "\n";
    }

    file.close();
}

开发者ID:STEllAR-GROUP，项目名称:hpx_historic，代码行数:32，代码来源:explicit_qr_algorithm.cpp

示例2: random_symmetric_matrix

inline void random_symmetric_matrix(
    orthotope<T>& A
  , std::size_t seed
    )
{
    BOOST_ASSERT(2 == A.order());
    BOOST_ASSERT(A.hypercube());

    std::size_t const n = A.extent(0);

    boost::random::mt19937_64 rng(seed);
    boost::random::uniform_int_distribution<> dist(-100, 100);

    for (std::size_t l = 0; l < n; ++l)
        A(l, l) = T(dist(rng));

    for (std::size_t l = 0; l < (n - 1); ++l)
    {
        for (std::size_t i = l + 1; i < n; ++i)
        {
            A(i, l) = T(dist(rng));
            A(l, i) = A(i, l);
        }
    }
}

开发者ID:STEllAR-GROUP，项目名称:hpx_historic，代码行数:25，代码来源:explicit_qr_algorithm.cpp

示例3: euclidean_norm

inline T euclidean_norm(
    orthotope<T> const& w
    )
{
    BOOST_ASSERT(1 == w.order());

    T sum = T();

    for (std::size_t i = 0; i < w.extent(0); ++i)
        sum += (w(i) * w(i));

    return std::sqrt(sum);
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:13，代码来源:householder_qr_factorization.cpp

示例4: matrix_add

inline void matrix_add(
    orthotope<T> const& A
  , orthotope<T> const& B
    )
{
    BOOST_ASSERT(2 == A.order());
    BOOST_ASSERT(2 == B.order());
    BOOST_ASSERT(A.hypercube());
    BOOST_ASSERT(B.hypercube());

    std::size_t const n = A.extent(0);

    for (std::size_t i = 0; i < n; ++i)
        for (std::size_t j = 0; j < n; ++j)
            A(i, j) += B(i, j);
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:16，代码来源:householder_qr_factorization.cpp

示例5: random_matrix

inline void random_matrix(
    orthotope<T>& A
  , std::size_t seed
    )
{
    BOOST_ASSERT(2 == A.order());

    std::size_t const n = A.extent(0);
    std::size_t const m = A.extent(1);

    boost::random::mt19937_64 rng(std::time(0));
    boost::random::uniform_int_distribution<> dist(-100, 100);

    for (std::size_t i = 0; i < n; ++i)
        for (std::size_t j = 0; j < m; ++j)
            A(i, j) = T(dist(rng));
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:17，代码来源:householder_qr_factorization.cpp

示例6: householders_tri_factor

void householders_tri_factor(
    orthotope<T>& A
  , std::size_t block_size
  , T eps = 1e-8
    )
{
    BOOST_ASSERT(2 == A.order());
    BOOST_ASSERT(A.hypercube());

    std::size_t const n = A.extent(0);

    for (std::size_t l = 0; l < (n - 2); ++l)
    {
        boost::int16_t sign = -compute_sign(A(l + 1, l));

        T alpha = 0.0;

        for (std::size_t j = (l + 1); j < n; ++j)
            alpha += (A(j, l) * A(j, l));

        if (alpha < eps)
            continue;

        alpha = sign * std::sqrt(alpha);

        T const r = std::sqrt(0.5 * ((alpha * alpha) - (alpha * A(l + 1, l))));

        orthotope<T> w({n});

        w(l + 1) = (A(l + 1, l) - alpha) / (2.0 * r); 

        for (std::size_t j = (l + 2); j < n; ++j)
            w(j) = A(j, l) / (2.0 * r);

        orthotope<T> H = compute_H(w);

        /// A_l = H * A_l_minus_1 * H
        orthotope<T> H_A_l_minus_1 = blocked_matrix_multiply(H, A, block_size);

        A = blocked_matrix_multiply(H_A_l_minus_1, H, block_size);
    }
}

开发者ID:STEllAR-GROUP，项目名称:hpx_historic，代码行数:42，代码来源:explicit_qr_algorithm.cpp

示例7: matrix_multiply

inline orthotope<T> matrix_multiply(
    orthotope<T> const& A
  , orthotope<T> const& B
    )
{
    BOOST_ASSERT(A.order() == 2);
    BOOST_ASSERT(B.order() == 2);
    BOOST_ASSERT(A.extent(1) == B.extent(0));

    // (n x m) * (m x p) = (n x p)
    std::size_t const n = A.extent(0);
    std::size_t const m = A.extent(1);
    std::size_t const p = B.extent(1);

    orthotope<T> C({n, p});

    for (std::size_t i = 0; i < n; ++i)
    {
        for (std::size_t j = 0; j < p; ++j)
        {
            T sum = T();

            for (std::size_t l = 0; l < m; ++l)
                sum += A(i, l) * B(l, j);

            C(i, j) = sum;
        }
    }

    return C;
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:31，代码来源:householder_qr_factorization.cpp

示例8: print

inline void print(
    orthotope<T> const& A
  , std::string const& name
    )
{
    BOOST_ASSERT(2 == A.order());

    for (std::size_t i = 0; i < A.extent(0); ++i)
    {
        if (i == 0)
            std::cout << (boost::format("%- 8s = [ ") % name);
        else
            std::cout << (boost::format("%|11T |[ "));

        for (std::size_t j = 0; j < A.extent(1); ++j)
            output_float(A(i, j));

        std::cout << "]\n";
    }

    std::cout << "\n";
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:22，代码来源:householder_qr_factorization.cpp

示例9: compute_H

inline orthotope<T> compute_H(
    orthotope<T> const& w
    )
{
    BOOST_ASSERT(1 == w.order());

    std::size_t const n = w.extent(0);

    orthotope<T> H({n, n});

    for (std::size_t i = 0; i < n; ++i)
    {
        for (std::size_t j = 0; j < n; ++j)
        {
            if (i == j)
                H(i, j) = 1 - 2 * (w(i) * w(j));
            else
                H(i, j) = 0 - 2 * (w(i) * w(j)); 
        }
    }

    return H;
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:23，代码来源:householder_qr_factorization.cpp

示例10: compute_sigma

inline T compute_sigma(
    orthotope<T> const& R
  , std::size_t n
  , std::size_t l
    )
{
    BOOST_ASSERT(2 == R.order());

    T sum = T();

    for (std::size_t i = l; i < n; ++i)
        sum += (R(i, l) * R(i, l));

    return std::sqrt(sum);
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:15，代码来源:householder_qr_factorization.cpp

示例11: blocked_matrix_multiply

inline orthotope<T> blocked_matrix_multiply(
    orthotope<T> const& A
  , orthotope<T> const& B
  , std::size_t block_size
    )
{
    BOOST_ASSERT(2 == A.order());
    BOOST_ASSERT(2 == B.order());
    BOOST_ASSERT(A.hypercube());
    BOOST_ASSERT(B.hypercube());
    BOOST_ASSERT(0 != block_size);
    BOOST_ASSERT(0 == (A.extent(0) % block_size));

    std::size_t const n = A.extent(0);

    orthotope<T> C({n, n});

    // TODO: Figure out how large this will be and do a reserve.
    std::vector<hpx::lcos::future<void> > stop_list;

    for (std::size_t i = 0; i < n; i += block_size)
    {
        for (std::size_t j = 0; j < n; j += block_size)
        {
            orthotope<T> C_sub(C, {block_size, block_size}, {i, j});
            matrix_mutex mtx;

            for (std::size_t l = 0; l < n; l += block_size)
            {
                orthotope<T> A_sub(A, {block_size, block_size}, {i, l})
                           , B_sub(B, {block_size, block_size}, {l, j});

                stop_list.push_back(
                    hpx::async<multiply_and_add_action>(
                            hpx::find_here(), C_sub, A_sub, B_sub, mtx
                        ).get_future());
            } 
        }
    }

    hpx::lcos::wait(stop_list);

    return C;
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:44，代码来源:householder_qr_factorization.cpp

示例12: matrix_equal

inline bool matrix_equal(
    orthotope<T> const& A
  , orthotope<T> const& B
    )
{
    // Are A and B both 2 dimensional?
    if ((2 != A.order()) || (2 != B.order()))
        return false;

    // Do A and B have the same dimensions?
    if ((A.extent(0) != B.extent(0)) || (A.extent(1) != B.extent(1)))
        return false;

    std::size_t const n = A.extent(0);
    std::size_t const m = A.extent(1);

    for (std::size_t i = 0; i < n; ++i)
        for (std::size_t j = 0; j < m; ++j)
            if (!compare_floating(A(i, j), B(i, j)))
                return false;

    return true;
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:23，代码来源:householder_qr_factorization.cpp

示例13: householders

void householders(
    orthotope<T> const& A
    )
{
    BOOST_ASSERT(2 == A.order());
    BOOST_ASSERT(A.hypercube());

    std::size_t const n = A.extent(0);

    orthotope<T> R = A.copy();
    orthotope<T> Q({n, n});

    for (std::size_t l = 0; l < n; ++l)
        Q(l, l) = 1.0;

    for (std::size_t l = 0; l < (n - 1); ++l)
    {
        T const sigma = compute_sigma(R, n, l);
        boost::int16_t const sign = compute_sign(R(l, l));

        #if defined(HPXLA_DEBUG_HOUSEHOLDERS)
            std::cout << (std::string(80, '#') + "\n")
                      << "ROUND " << l << "\n\n";

            print(sigma, "sigma");
            print(sign, "sign");
        #endif

        orthotope<T> w({n});

        w(l) = R(l, l) + sign * sigma;
 
        for (std::size_t i = (l + 1); i < w.extent(0); ++i)
            w(i) = R(i, l);

        #if defined(HPXLA_DEBUG_HOUSEHOLDERS)
            print(w, "u");
        #endif

        T const w_norm = euclidean_norm(w);

        for (std::size_t i = l; i < n; ++i)
            w(i) /= w_norm;

        #if defined(HPXLA_DEBUG_HOUSEHOLDERS)
            print(w, "v");
        #endif

        orthotope<T> H = compute_H(w);

        #if defined(HPXLA_DEBUG_HOUSEHOLDERS)
            print(H, "H");
        #endif

        R = matrix_multiply(H, R);

        Q = matrix_multiply(Q, H);

        for (std::size_t i = l + 1; i < n; ++i)
            R(i, l) = 0;
    }

    #if defined(HPXLA_DEBUG_HOUSEHOLDERS)
        std::cout << std::string(80, '#') << "\n";
    #endif

    print(A, "A");
    print(Q, "Q");
    print(R, "R");

    #if defined(HPXLA_DEBUG_HOUSEHOLDERS)
        check_QR(A, Q, R);
    #endif
}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:74，代码来源:householder_qr_factorization.cpp

示例14: check_QR

void check_QR(
    orthotope<T> const& A
  , orthotope<T> const& Q
  , orthotope<T> const& R
    )
{ // {{{
    BOOST_ASSERT(2 == A.order());
    BOOST_ASSERT(2 == Q.order());
    BOOST_ASSERT(2 == R.order());
    BOOST_ASSERT(A.hypercube());
    BOOST_ASSERT(Q.hypercube());
    BOOST_ASSERT(R.hypercube());

    std::size_t const n = A.extent(0);

    BOOST_ASSERT(n == Q.extent(0));
    BOOST_ASSERT(n == R.extent(0));

    ///////////////////////////////////////////////////////////////////////////
    /// Make sure Q * R equals A.
    orthotope<T> QR = matrix_multiply(Q, R);

    for (std::size_t l = 0; l < n; ++l)
    {
        for (std::size_t i = 0; i < n; ++i)
        {
            if (!compare_floating(A(l, i), QR(l, i), 1e-6)) 
                std::cout << "WARNING: QR[" << l << "][" << i << "] (value "
                          << QR(l, i) << ") is not equal to A[" << l << "]["
                          << i << "] (value " << A(l, i) << ")\n";
        }
    }

    ///////////////////////////////////////////////////////////////////////////
    /// Make sure R is an upper triangular matrix. 
    for (std::size_t l = 0; l < (n - 1); ++l)
    {
        for (std::size_t i = l + 1; i < n; ++i)
        {
            if (!compare_floating(0.0, R(i, l), 1e-6))
                std::cout << "WARNING: R[" << i << "][" << l << "] is not 0 "
                             "(value is " << R(i, l) << "), R is not an upper "
                             "triangular matrix\n";
        }
    }

    ///////////////////////////////////////////////////////////////////////////
    /// Make sure Q is orthogonal. A matrix is orthogonal if its transpose is
    /// equal to its inverse:
    ///
    ///     Q^T = Q^-1
    ///
    /// This implies that:
    ///
    ///     Q^T * Q = Q * Q^T = I
    /// 
    /// We use the above formula to verify Q's orthogonality. 
    orthotope<T> QT = Q.copy();

    // Transpose QT.
    for (std::size_t l = 0; l < (n - 1); ++l)
        for (std::size_t i = l + 1; i < n; ++i)
            std::swap(QT(l, i), QT(i, l));

    // Compute Q^T * Q and store the result in QT.
    QT = matrix_multiply(Q, QT);

    for (std::size_t l = 0; l < n; ++l)
    {
        for (std::size_t i = 0; i < n; ++i)
        {
            // Diagonals should be 1. 
            if (l == i)
            {
                if (!compare_floating(1.0, QT(l, i), 1e-6)) 
                    std::cout << "WARNING: (Q^T * Q)[" << l << "][" << i << "] "
                                 "is not 1 (value is " << QT(l, i) << "), Q is "
                                 "not an orthogonal matrix\n";
            }

            // All other entries should be 0.
            else
            {
                if (!compare_floating(0.0, QT(l, i), 1e-6)) 
                    std::cout << "WARNING: (Q^T * Q)[" << l << "][" << i << "] "
                                 "is not 0 (value is " << QT(l, i) << "), Q is "
                                 "not an orthogonal matrix\n";
            }
        }
    }
} // }}}

开发者ID:fpelliccioni，项目名称:hpx，代码行数:91，代码来源:householder_qr_factorization.cpp

示例15: qr_eigenvalue

std::vector<std::complex<T> > qr_eigenvalue(
    orthotope<T> const& A
  , std::size_t max_iterations
  , std::size_t block_size 
  , T const& tolerance = 1.0
    )
{
    BOOST_ASSERT(2 == A.order());
    BOOST_ASSERT(A.hypercube());

    std::size_t const n = A.extent(0); 

/*
    std::vector<std::complex<T> > evs;
    evs.reserve(n);
*/

    std::complex<T> const nan_(std::numeric_limits<T>::quiet_NaN()
                             , std::numeric_limits<T>::quiet_NaN());

    std::vector<std::complex<T> > evs(n, nan_), old(n, nan_);

    orthotope<T> Ak = A.copy(), R, Q;

    householders_tri_factor(Ak, block_size);

    write_matrix_to_octave_file(Ak, "hess_A0");

    std::size_t iterations = 0;

    while (true)
    {
/*
        T const mu = Ak(n, n);

        if (0 != iterations)
        {
            for (std::size_t i = 0; i < (n - 1); ++i)
                Ak(i, i) -= mu;

            Ak(n, n) = 0.0;
        }
*/

        householders_qr_factor(Ak, Q, R, block_size);

        Ak = blocked_matrix_multiply(R, Q, block_size); 

/*
        if (0 != iterations)
            for (std::size_t i = 0; i < n; ++i)
                Ak(i, i) += mu;
*/

/*
        bool pseudo_upper_triangular = true;

        for (std::size_t j = 0; j < (n - 1); ++j)
        {
            // Make sure we're in Hessenberg form.
            for (std::size_t i = j + 2; i < n; ++i)
            {
                if (!compare_floating(0.0, Ak(i, j), 1e-6))
                    pseudo_upper_triangular = false;
            }

            /// Check for convergence. Either we converge to 2x2 complex
            /// conjugates eigenvalues, which take the form:
            ///
            ///     [ a  b ]
            ///     [ c  a ]
            ///
            /// Where b * c < 0. Or, we converge to real eigenvalues which take
            /// the form:
            ///
            ///     [ a ]
            ///     [ 0 ]
            ///

            // Determine if we've failed to converge to a real eigenvalue. 
            if (!compare_floating(0.0, Ak(j, j + 1), 1e-6))
            {
                // Determine if we've failed to converge to a pair of complex
                // eigenvalues.
                if (!compare_floating(Ak(j, j), Ak(j + 1, j + 1), 1e-6))
                    pseudo_upper_triangular = false;
            }
        }
*/

        bool converged = true;

//        std::cout << "ITERATION " << iterations << "\n";

        for (std::size_t j = 0; j < n; ++j)
        {
            if (j != n)
            {
                // Check for complex eigenvalues.
                if (!compare_floating(0.0, Ak(j + 1, j), 1e-6))
//.........这里部分代码省略.........

开发者ID:STEllAR-GROUP，项目名称:hpx_historic，代码行数:101，代码来源:explicit_qr_algorithm.cpp

注：本文中的orthotope类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

C++ ossSLatch类代码示例发布时间：2022-05-31

C++ options_description类代码示例发布时间：2022-05-31

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：18239|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9667|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8175|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8547|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8453|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9383|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8425|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7858|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8410|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7394|2022-11-06

客服电话

电子邮件

C++ orthotope类代码示例

示例1: write_matrix_to_octave_file

示例2: random_symmetric_matrix

示例3: euclidean_norm

示例4: matrix_add

示例5: random_matrix

示例6: householders_tri_factor

示例7: matrix_multiply

示例8: print

示例9: compute_H

示例10: compute_sigma

示例11: blocked_matrix_multiply

示例12: matrix_equal

示例13: householders

示例14: check_QR

示例15: qr_eigenvalue

请发表评论

全部评论

上一篇：

下一篇：

GitbookIO/gitbook:

juleswhite/mobile-cloud-asgn1

CVE-2022-36900

kyamagu/matlab-json: Use official API: h

墙壁眼睛膝盖

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053