metodo cholesky
2016-08-23
0 0 0
no vote
Other
Earn points
#include<stdio.h>
#include<conio.h>
#include<math.h>
void llenarm(float matrizA[100][100],int n){
for(int i=0;i<=n-1;i++){
for(int j=0;j<=n-1;j++){
printf("Ingresar A[%d][%d]=",i,j);
scanf("%f",&matrizA[i][j]);}
}
}
void llenarv(float matrizB[100],int n){
for(int j=0;j<=n-1;j++){
printf("Ingresar B[%d]=",j);
scanf("%f",&matrizB[j]);}
#include<conio.h>
#include<math.h>
void llenarm(float matrizA[100][100],int n){
for(int i=0;i<=n-1;i++){
for(int j=0;j<=n-1;j++){
printf("Ingresar A[%d][%d]=",i,j);
scanf("%f",&matrizA[i][j]);}
}
}
void llenarv(float matrizB[100],int n){
for(int j=0;j<=n-1;j++){
printf("Ingresar B[%d]=",j);
scanf("%f",&matrizB[j]);}
c++
方法
分解
Cholesky
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
Test Hello world
0
0
no vote
RCS calculation by one-way ray tracing
0
0
no vote
No comment