Skip to content
TheChatArchiveThe Chat Archive
gpt-3.5-turbo-0125· openaiHugging Face Suzhen/CodeChat

напиши функцию умножения квадратной матрицы double* A[N * N] на вектор double* B[N] на…

  1. User

    напиши функцию умножения квадратной матрицы double* A[N * N] на вектор double* B[N] на языке C++

  2. Assistant
    #include <iostream>
    
    const int N = 3;
    
    void matrixVectorMultiplication(double A[N][N], double B[N], double result[N]) {
        for (int i = 0; i < N; ++i) {
            result[i] = 0;
            for (int j = 0; j < N; ++j) {
                result[i] += A[i][j] * B[j];
            }
        }
    }
    
    int main() {
        double A[N][N] = {
            {1, 2, 3},
            {4, 5, 6},
            {7, 8, 9}
        };
        
        double B[N] = {1, 2, 3};
        double result[N];
    
        matrixVectorMultiplication(A, B, result);
    
        std::cout << "Result vector after matrix-vector multiplication:" << std::endl;
        for (int i = 0; i < N; ++i) {
            std::cout << result[i] << " ";
        }
        std::cout << std::endl;
    
        return 0;
    }
    
  3. User

    Напиши программу, считающую решение системы линейных уравнений. A - квадратная матрица размера N, b - вектор размера N, x - вектор ответов

  4. Assistant
    #include <iostream>
    #include <cmath>
    
    const int N = 3;
    
    void matrixVectorMultiplication(double A[N][N], double B[N], double result[N]) {
        for (int i = 0; i < N; ++i) {
            result[i] = 0;
            for (int j = 0; j < N; ++j) {
                result[i] += A[i][j] * B[j];
            }
        }
    }
    
    void solveLinearSystem(double A[N][N], double b[N], double x[N]) {
        double det = A[0][0] * (A[1][1] * A[2][2] - A[1][2] * A[2][1]) 
                    - A[0][1] * (A[1][0] * A[2][2] - A[1][2] * A[2][0]) 
                    + A[0][2] * (A[1][0] * A[2][1] - A[1][1] * A[2][0]);
        
        if (std::abs(det) < 1e-6) {
            std::cout << "Error: Singular matrix, cannot solve the system." << std::endl;
            return;
        }
    
        double invDet = 1.0 / det;
        double adj[N][N] = {{0}};
    
        adj[0][0] = A[1][1] * A[2][2] - A[1][2] * A[2][1];
        adj[0][1] = - (A[1][0] * A[2][2] - A[1][2] * A[2][0]);
        adj[0][2] = A[1][0] * A[2][1] - A[1][1] * A[2][0];
        adj[1][0] = - (A[0][1] * A[2][2] - A[0][2] * A[2][1]);
        adj[1][1] = A[0][0] * A[2][2] - A[0][2] * A[2][0];
        adj[1][2] = - (A[0][0] * A[2][1] - A[0][1] * A[2][0]);
        adj[2][0] = A[0][1] * A[1][2] - A[0][2] * A[1][1];
        adj[2][1] = - (A[0][0] * A[1][2] - A[0][2] * A[1][0]);
        adj[2][2] = A[0][0] * A[1][1] - A[0][1] * A[1][0];
    
        double adjT[N][N] = {{0}};
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                adjT[i][j] = adj[j][i];
            }
        }
    
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                A[i][j] = adjT[i][j] * invDet;
            }
        }
    
        matrixVectorMultiplication(A, b, x);
    }
    
    int main() {
        double A[N][N] = {
            {1, 2, 3},
            {2, 5, 2},
            {3, 1, 4}
        };
    
        double b[N] = {14, 9, 11};
        double x[N];
    
        solveLinearSystem(A, b, x);
    
        std::cout << "Solution vector of the linear system:" << std::endl;
        for (int i = 0; i < N; ++i) {
            std::cout << x[i] << " ";
        }
        std::cout << std::endl;
    
        return 0;
    }
    

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.