I just want to know the code of the program: Write code to accept matrix as aurgument and display its multiplication matrix which return its multiplication matrix.
View 1 Replies
Code:
#include<stdio.h>
#include<conio.h>
void main()
[Code] .....
This program on running returns an error of "ILLEGAL USE OF POINTER".
Code:
#include<stdio.h> Code: #include<conio.h>
void main() {
int *a[2][2],*b[2][2],*c[2][2],i,j,k;
Printf("
ENTER a MATRIX ELEMENTS
[Code] .....
I have been using SSE/ SIMD Matrix multiplication approaches and I persistently get this error:
void mmul_sse_nsize(const float * a, const float * b, float * r, int size) {
__m128 a_line, b_line, r_line;
int bound = size*size;
int rows = size;
[Code] ....
The code almost never throws the error when matrices are size NxN, N =4.
Also, I have a 4 core laptop with 2 GB RAM and I am using VS2013.
I am trying to read two matrices from individual .txt file, and later trying to multiply them. But I am unable to succeed.
Here is the code.
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
// Here starts the main
int main()
{ // The two input values
FILE *inputFile1;
FILE *inputFile2;
[Code] .....
I am able to get only the first values as the output. The first matrix is 5x3, and the second one is a 3x3 matrix.
Matrix 1
1 2 3
4 5 6
7 8 9
10 11 12
Matrix 2
1 2 3
4 5 6
7 8 9
The output which I am getting is
Enter File name of matrix #1 - with extention - : matrix1.txt
Enter File name of matrix #2 - with extention - : matrix2.txt
Rows1 = 1 Cols1 = 2
Rows2 = 1
Cols2 = 2Cant multiply those two matrices
I have Problem with matrix vector multiplication in program..
void matrixVector ( const int n, const double* A, const double* x, double* y ){
//for(int i = 0; i < n; i++){
// y[i*n] = 0.0;
// }
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
y[i*n] += A[i*n+j]*x[j*n];
[Code] ....
I am writing a brute force implementation of matrix multiplication:
Header file:
vector<vector<int> > matrix_multiplication(vector <vector<int> >& a, vector <vector<int> >& B)/>/>/>;
Source file:
vector<vector<int> > matrix_multiplication(vector <vector<int> >& a, vector <vector<int> >& B)/>/>/>{
int n = a.size();
vector< vector <int> > c (n , vector<int> (n));
for (int i =0 ; i<n ; i++){
for (int j =0 ; j < n ; j++){
for (int k ; k < n ; k++){
c[i][j] = a[i][k] + b[k][j];
[Code] ....
I keep on getting occasional seg faults />/>. I can't see why.
How to write matrix multiplication (without using arrays) in C ....
View 1 Replies View RelatedSo basically I have to tell the user to input data and i use a for loop:
for (i=0; i< 3; i++)
cin >> p[i][0],p[i][1], p[i][2];
Now for the confusing part is, what do i put in the nested for loops to multiply them and output them so it looks something like
matrix p,r1: # # #
" ",r2: " "
" " " "
I would like to know how could I make multiplication of matrix called betrix in this code:
Code:
printf("transposed matrix:
");
int trantrix[size][size]; //transposed matrix
for(i=0;i<size;i++) {
for(j=0;j<size;j++) {
trantrix[i][j] = matrix[j][i];
printf("%d ",trantrix[i][j]);
[Code] ......
I just started Linear Algebra for my programming degree and to full understand everything I want to put it into code and make my own "matrix calculator." I have all the theory but I am having issues keeping the matrix variable and moving it around the class' functions to create it and output it. Once I know I have it saved I think I can get the addition/multiplication to work. Here is the code I have so far:
#include <string>
#include <iostream>
using namespace std;
class matrix {
[Code] ....
I have a program matrix multiplication but it work not for big arrays. n should be bis 200.
#include <iostream>
#include <time.h>
#include <cstdlib>
[Code]....
I am actually working on IEEE Arithmetic especially the IEEE 754 specification where the IEEE double only have 53 bits of precision. I am working on Z/nZ matrix multiplication that works on 53 bits specs. How to write a matrix multiplication algorithm that works well on 53 bits IEEE precision standard.
View 5 Replies View RelatedI have a problem with dynamic massive. My task was to find the multiplication of positive matrix elements with using indexes and seperated compiling.
Compiler doesn't warn me about any mistake, but result is not right, it is even not a number.
Header.h
#include <iostream>
#include <math.h>
using namespace std;
float multi(int k, int t, float **p);
[Code] ....
I've been trying to get my matrix multiplication program to run a few different ways. My assignments wants me to run it statically using chunks, but we're not supposed to use OpenMPs scheduler. So I'm not sure how that's possible. And secondly, we have to run it dynamically using locks/unlocks.
Static (not sure how to implement chunk)
#pragma omp section
{
printf("Thread %d doing matrix mult", threadID);
if (matrixAcols != matrixBrows) {
cout << "Error, operation not possible" << endl;
[Code]....
The code will run for a long time too. It uses as many threads as we tell it to but it never speeds up the results.
Quote
Thread 2 doing matrix mult
Thread 4 doing matrix mult
Thread 2 doing matrix mult
Thread 4 doing matrix mult
Thread 2 doing matrix mult
Thread 4 doing matrix mult
Thread 2 doing matrix mult
Thread 4 doing matrix mult
Thread 4 doing matrix mult
Thread 4 doing matrix mult
Thread 4 doing matrix mult
Thread 4 doing matrix mult
Thread 4 doing matrix mult
Thread 4 doing matrix mult
I wrote program for Sequential matrix multiplication .But after execution for any input value( ex. 100,150,400) it shows the execution time is 0.000 msec.
#include <stdio.h>
#include <math.h>
#include <sys/time.h>
void print_results(char *prompt, int N, float *a);
int main(int argc, char *argv[])
[Code] ......
I wrote a sequential matrix multiplication program in c.
After execution i get error like
./mul.c: line 11: syntax error near unexpected token `('
./mul.c: line 11: `int main(){'
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define wA (30 * 16)
#define wB (50 * 16)
#define hA (80 * 16)
#define hB wA
#define wC wB
[Code] ....
i want to know how i can solve this question? do i need to create a class or write the program codes.
View 12 Replies View RelatedWrite a c++ program to display a matrix of multiples of 4 from 1 upto 30 .....
View 1 Replies View RelatedI want to assign a matrix to submatrix of a bigger matrix.
ublas::matrix<int> A(8,5);
ublas::matrix<int> B(2,5);
for(size_t i=0;i<A.size1();++i)
for(size_t j=0;j<A.size2();++j)
A(i,j)=i*A.size2()+j+1;
for(size_t i=0;i<B.size1();++i)
for(size_t j=0;j<B.size2();++j)
B(i,j)=i*B.size2()+j+5;
ublas::matrix_range<ublas::matrix<int> > a(A,ublas::range(0,2),ublas::range(0,5));
a=B;
and it works.
but if the matrix is compressed_matrix type, there's something with it. the error log as below:
Check failed in file boost_1_48_0/boost/numeric/ublas/detail/matrix_assign.hpp at line 1078:
detail::expression_type_check (m, cm)
terminate called after throwing an instance of 'boost::numeric::ublas::external_logic'
what(): external logic
Aborted
I'm not sure this is a bug or not.
I have to prepare a project. But I don t know how can I do this. Program will find a matrix P for a square matrix A such that P^-1 A P ....
View 15 Replies View Related3 3
2 1 3 2 3
1 0 2
1 2 6
First line shows row and column number
First index of the second line tells the number of non-zero entries of the first row and second index tell the column number where the non zero entry is placed
for 1st row of matrix:
non-zero entries=2
column number=1
non-zero entry=3
column number=2
non-zero entry=2
covert this in the given form
0 3 3
2 0 0
0 0 6
I was trying to look up solution for this for quite a while already but found nothing. I am writing a simple console based turn based RPG game for my class project. I was trying to have a member function attack() in class of the player character, which affects the component called health of the class Enemy. both this classes are inherited from the base class Unit. I tried to pass the object of type enemy as an argument to the function attack, but the function call gives me Error: too many arguments in function call. Here's the code for classes:
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <string>
using namespace std;
class Unit {
protected: int power, intellect;
[Code] ....
I have to write a program to display multiplication tables. I have written the following code:
Code:
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
[Code] ....
i need the output to display the product of every whole number from 1-3 in a table format.
this is the code i have so far. i know some brackets are missing but i just pasted the meat of the code. when i run the program i keep getting the number 1 displayed in a straight line going on forever
int multiply1 = 1;
int multiply2 = 1;
while(num1<=3)
{ // num1*num2;
//num1 = 0;
while(num2<=3)
{ Console.WriteLine(multiply1*multiply2);
if(num1>=3)
{ Console.Write();
}
}
num1++;
}
I have a 3x3x3 matrix with values hanging from 1 to 27.
The order is this: Code: m[0][0][0] = 1;
m[0][0][1] = 2;
m[0][0][2] = 3;
m[0][1][0] = 4;
m[0][1][1] = 5;
m[0][1][2] = 6;
.
.
.
m[1][0][0] = 10;
m[1][0][1] = 11;
m[1][0][2] = 12;
.
.
.
m[2][2][0] = 25;
m[2][2][1] = 26;
m[2][2][2] = 27;
Is there an easy way to compute the indexes given the value? For example, I know that the first index can be found by dividing the value by 9.0: Code: const int firstIndex = ceil(value / 9.0) - 1; What about the second and the third indexes? I couldn't find a pattern in the numbers, and I didn't want to iterate through the matrix (the indexes will be calculated many times).
The other option is to create arrays where the values will be indexes and the matrix indexes will be the values. I'm not sure if it is the best way though
