尝试改写BigDecimalDemo类中的div(double value1,double value2, int b, int r)方法,以不同近似处理模式处理商的精度。

package javase9;

import java.math.BigDecimal;

public class javase9_3 {
    public static BigDecimal div(double value1, double value2, int b,int r){
        if (b<0){
            System.out.println("以不同近似处理模式处理商的精度");
        }
        BigDecimal b1=new BigDecimal(value1);
        BigDecimal b2=new BigDecimal(value2);
        return b1.divide(b2,b,r);
    }

    public static void main(String[] args) {
        javase9_3 u=new javase9_3();
//如果商为整数按照ROUND_UP处理,负数按照ROUND_DOWN处理。
        System.out.println(u.div(-7.5,8.9,5,BigDecimal.ROUND_CEILING));
//与ROUND_CEILING相反
        System.out.println(u.div(-7.5,8.9,5,BigDecimal.ROUND_FLOOR));
//最后一个数省略
        System.out.println(u.div(-7.5,8.9,5,BigDecimal.ROUND_DOWN));
//如果商第二位数位奇数,则按照ROUND_HALF_UP处理,偶数则ROUND_UP处理。
        System.out.println(u.div(-7.5,8.9,5,BigDecimal.ROUND_HALF_DOWN));
//对商进行四舍五入操作。
        System.out.println(u.div(-7.5,8.9,5,BigDecimal.ROUND_HALF_UP));
//最后一位数大于0,则进位
        System.out.println(u.div(-7.5,8.9,5,BigDecimal.ROUND_UP));
    }
}
  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
1) 采用Local_trap改写梯形积分的OpenMP并行程序: ```c++ #include <iostream> #include <omp.h> double f(double x) { return x * x; } double Local_trap(double a, double b, int n) { double h = (b - a) / n; double sum = 0.0; #pragma omp parallel for reduction(+:sum) for (int i = 1; i < n; i++) { sum += f(a + i * h); } sum += (f(a) + f(b)) / 2.0; sum *= h; return sum; } int main() { double a = 0.0, b = 1.0; int n = 10000000; double result_seq = Local_trap(a, b, n); double result_par = Local_trap(a, b, n); std::cout << "Sequential result: " << result_seq << std::endl; std::cout << "Parallel result: " << result_par << std::endl; return 0; } ``` 2) 利用critical和reduction两种方式保护临界区: - 使用critical关键字: ```c++ #include <iostream> #include <omp.h> double f(double x) { return x * x; } double Local_trap(double a, double b, int n) { double h = (b - a) / n; double sum = 0.0; #pragma omp parallel { double local_sum = 0.0; #pragma omp for for (int i = 1; i < n; i++) { local_sum += f(a + i * h); } #pragma omp critical sum += local_sum; } sum += (f(a) + f(b)) / 2.0; sum *= h; return sum; } int main() { double a = 0.0, b = 1.0; int n = 10000000; double result_seq = Local_trap(a, b, n); double result_par = Local_trap(a, b, n); std::cout << "Sequential result: " << result_seq << std::endl; std::cout << "Parallel result: " << result_par << std::endl; return 0; } ``` - 使用reduction关键字: ```c++ #include <iostream> #include <omp.h> double f(double x) { return x * x; } double Local_trap(double a, double b, int n) { double h = (b - a) / n; double sum = 0.0; #pragma omp parallel for reduction(+:sum) for (int i = 1; i < n; i++) { sum += f(a + i * h); } sum += (f(a) + f(b)) / 2.0; sum *= h; return sum; } int main() { double a = 0.0, b = 1.0; int n = 10000000; double result_seq = Local_trap(a, b, n); double result_par = Local_trap(a, b, n); std::cout << "Sequential result: " << result_seq << std::endl; std::cout << "Parallel result: " << result_par << std::endl; return 0; } ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

程序研

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值