Answered

How to compare two matrices of different dimentions and get the result in new column

Try this % find logical indices in A with 2000 idxLog = A == 2000; % create the new vector with B values in idxLog and zero...

How to compare two matrices of different dimentions and get the result in new column

Try this % find logical indices in A with 2000 idxLog = A == 2000; % create the new vector with B values in idxLog and zero...

circa 7 ore ago | 0

Question

Quadprog 'interior-point-convex' failure

Dear Matlab Gurus, I have a problem with Matlab quadprog function. A few years ago I implemented a code using quadprog with th...

circa 24 ore ago | 3 answers | 1

Question

symbolic derivative with constant output

Hi everyone, I am working on a code requiring the definition of an anonymous function that is the derivative of another anonymo...

4 mesi ago | 1 answer | 0

Question

Create symbolic matrix from triplets with repeated indices

Hi everyone, I am trying to build a symbolic matrix from the triplets iRow, jCol, aElm such that A(iRow(k),jCol(k)) = A(...

circa 2 anni ago | 2 answers | 0

Answered

Combine several code to a single code

Try |arrayfun| % the data X0=[5; -3; 3] y=[45;45;45] p=[30;30;30] r=[50;50;50] % the operation X1 =...

Combine several code to a single code

Try |arrayfun| % the data X0=[5; -3; 3] y=[45;45;45] p=[30;30;30] r=[50;50;50] % the operation X1 =...

oltre 2 anni ago | 0

Question

Rotation that maximises a vector length

Hi all, I have a problem that is more related to linear algebra than Matlab itself, even if I would like to solve it with Mat...

oltre 2 anni ago | 0 answers | 0

Answered

Rebuild a matrix from indices

Try linear indexing % the data A = [0 2 2 0 0 ; 2 0 0 2 2 ; 0 2 0 2 2 ; 0 0 0 2 2 ; 2 2 0 2 2]; [i,j] = find(A==2); ...

Rebuild a matrix from indices

Try linear indexing % the data A = [0 2 2 0 0 ; 2 0 0 2 2 ; 0 2 0 2 2 ; 0 0 0 2 2 ; 2 2 0 2 2]; [i,j] = find(A==2); ...

oltre 2 anni ago | 0

| accepted

Answered

How can i repeatedly store a smaller matrices after manipulations in a specific place of a larger matrix.

I think your first matrix should be 360x720 (and indexing starts with 1). Try this % create the matrices A = rand(360,72...

How can i repeatedly store a smaller matrices after manipulations in a specific place of a larger matrix.

I think your first matrix should be 360x720 (and indexing starts with 1). Try this % create the matrices A = rand(360,72...

oltre 2 anni ago | 0

Solved

Pizza!

Given a circular pizza with radius _z_ and thickness _a_, return the pizza's volume. [ _z_ is first input argument.] Non-scor...

circa 3 anni ago

Question

implementation of subclass from triangulation

Hi everyone, I am trying to implement a derived class from the 'triangulation' class available in Matlab 2014. The aim is to ...

oltre 3 anni ago | 3 answers | 0

Submitted

int_green3d

Analytical integration of the Green's function in 3d over plane surfaces

oltre 3 anni ago | 4 downloads |

Question

GPU computing on iMac

Hi everyone, I would like to buy an iMac mounting an NVIDIA GeForce GT 755M board, but I am not sure if this hardware meets t...

circa 4 anni ago | 1 answer | 0

Answered

How can I successfully solve a certain huge sparse matrix; i.e., 8e6 x 8e6 entries?

Sorry for late reply, I am on holiday! The method is described here O. Axelsson, A. Kucherov, "Real valued iterative metho...

How can I successfully solve a certain huge sparse matrix; i.e., 8e6 x 8e6 entries?

Sorry for late reply, I am on holiday! The method is described here O. Axelsson, A. Kucherov, "Real valued iterative metho...

circa 4 anni ago | 0

| accepted

Answered

How can I successfully solve a certain huge sparse matrix; i.e., 8e6 x 8e6 entries?

Chris, is the matrix complex symmetric (not-hermitian)? If so I think I have a possible solution to try. Fabio

How can I successfully solve a certain huge sparse matrix; i.e., 8e6 x 8e6 entries?

Chris, is the matrix complex symmetric (not-hermitian)? If so I think I have a possible solution to try. Fabio

circa 4 anni ago | 0

Answered

automatically cycle through function inputs

use varargin: function name(varargin) for i = 1:nargin figure(i), plot(varargin{1}); end end

automatically cycle through function inputs

use varargin: function name(varargin) for i = 1:nargin figure(i), plot(varargin{1}); end end

circa 4 anni ago | 0

Answered

Eliminating unnecessary portions of arrays from structure.

If I understand correctly you want something like this idx = find(data(1).IAS >= 290 & data(1).IAS <= 310); plot(data(1).A...

Eliminating unnecessary portions of arrays from structure.

If I understand correctly you want something like this idx = find(data(1).IAS >= 290 & data(1).IAS <= 310); plot(data(1).A...

circa 4 anni ago | 0

| accepted

Answered

Interpolating points of a 3D point cloud

Does triscatteredinterp make the job?

Interpolating points of a 3D point cloud

Does triscatteredinterp make the job?

circa 4 anni ago | 0

Answered

how to use copy options in matlab for mac?

can you use: Edit -> Copy Figure ?

how to use copy options in matlab for mac?

can you use: Edit -> Copy Figure ?

oltre 4 anni ago | 0

Answered

find missing elements in a matrix

Try this A=[1 2 3 6 7 45 46 47 53 78 80]; all = 1:80; missing = setdiff(all,A); Fabio

find missing elements in a matrix

Try this A=[1 2 3 6 7 45 46 47 53 78 80]; all = 1:80; missing = setdiff(all,A); Fabio

oltre 4 anni ago | 0

Answered

MATLAB in unexpected places

<http://www.phdcomics.com/comics/archive.php?comicid=1289> second scene

MATLAB in unexpected places

<http://www.phdcomics.com/comics/archive.php?comicid=1289> second scene

circa 5 anni ago | 1

Question

Iterative solver with gpuArray

Hi all, In some cases the use of iterative solvers is useful also with full matrices, which is my case. I would like to use a...

circa 5 anni ago | 2 answers | 1

Answered

Color a delaunay triangulation

Let's suppose that your triangulation is organized as follows * P: Nx2: node coordinates * T: Mx3: triangulation * F: Mx1: ...

Color a delaunay triangulation

Let's suppose that your triangulation is organized as follows * P: Nx2: node coordinates * T: Mx3: triangulation * F: Mx1: ...

circa 5 anni ago | 0

| accepted

Question

Sparse complex symmetric direct solver for windows

Hi everyone, I am looking for a dedicated direct solver for large sparse complex symmetric (not hermitian) systems. The problem...

circa 5 anni ago | 0 answers | 0