Community Profile

# Matt J

Last seen: Today 2009년부터 활동

Professional Interests: medical image processing, optimization algorithms PLEASE NOTE: I do not read email sent through my author page. Please post questions about FEX submissions in their respective Comments section.

All

배지 보기

#### Content Feed

보기 기준

질문

Isn't A=Comma-Separated-List dangerous?
I have a function below called renamefields() which, as the name suggests, renames a desired subset of struct array fields as de...

26분 전 | 답변 수: 0 | 0

### 0

답변

답변 있음
How to get comlex root of an equation using fminbnd?
fminbnd is for minimzing over a 1D interval. It's not clear to me how you are defining 1D interval bounds for a number that does...

약 15시간 전 | 0

답변 있음
Issues in the constraint functions of the Optimization Problem solving
function [c,ceq]= area(x0) M=5; % x0=[5,8]; M2=m(M,x0(1)); M3=m(M2,x0(2)); M4=m(M3,(x0(1)+x0(2))); beta1=b(M,(x0(1)))...

1일 전 | 0

답변 있음
collapsing rows of a cell array into a single cell
Data2=num2cell(Data,1); However, I wonder why you would want to do this. Matrices are usually faster to manipulate than cells, ...

1일 전 | 0

| 수락됨

질문

How many columns can the input to the JacobianMultiplyFcn have?
I am using the JacobianMultiplyFcn option of lsqnonlin. The documentation says that JacobianMultiplyFcn is to be a handle to a f...

1일 전 | 답변 수: 0 | 0

### 0

답변

답변 있음
fsolve with two variables in a loop
fun=@(z)[fx(z(1),T(j));fy(z(2),T(j))];

2일 전 | 0

| 수락됨

답변 있음
w=(hr'*Theta*G +hd')'; w=sqrt(P)*w/norm(w);

3일 전 | 0

| 수락됨

답변 있음
Split one table into multiple tables based on multiple variables without reordering.
T=readtable('Data - 2023-01-26_question'); G=findgroups(T(:,1:2)); I=(1:numel(G))'; splitTables = splitapply(@(i){T(i,:)}...

3일 전 | 0

| 수락됨

답변 있음
Upper bound curve that passes through the extreme (highest) points
load D_by_t_u; load surge_height_1m; final_mat = []; for i = 1:length(surhe_height_1m) if surhe_height_1m(i) > 0.02 ...

3일 전 | 0

| 수락됨

답변 있음
How do I multiply the numbers in a 2D array using a for loop, must be a for loop as part of the course requirements
One way: A3=nan(size(B)); for i=1:size(B,2) A3(:,i)=sind(B(:,i)).^2; end

3일 전 | 0

| 수락됨

답변 있음
How to solve "Conversion to logical from optim.problemdef.OptimizationEquality is not possible." ?
This will solve the "Conversion to logical" error, but not all of the other issues raised by Torsten and me. In particular, Gene...

3일 전 | 0

| 수락됨

답변 있음
How to simplify too much of if
FP=[39 45 33 36 27 30, 29,33,24,28,20,24,... 41 46 34,38,29,32,32,36,25,30,22,25,36,49,38,41,31,34,35,39,.... 29,32,24...

3일 전 | 0

답변 있음
Why DerivativeCheck would be allowed to be on while there is no GradObj?
Here's a reason why you might want to allow DerivativeCheck to be on even when the analytical gradient computations are all off....

3일 전 | 0

| 수락됨

답변 있음
Why DerivativeCheck would be allowed to be on while there is no GradObj?
So why would MATLAB allow the DerivativeCheck to be on if there is no gradient available? Because maybe SpecifyConstraintGradie...

4일 전 | 0

답변 있음
Effect of zero padding on FFT amplitude
@Rahul Kale It occurs to me now that you are not really trying to compute the Fourier transform of a finite signal. You are inst...

4일 전 | 0

답변 있음
Way to solve AX=XB
[ma,na]=size(A); [mb,nb]=size(B); %size(X)=[na,mb] X=null( kron(speye(mb),A) - kron(B.',speye(na)) ); X=reshape(X,na,mb...

4일 전 | 0

답변 있음
Why DerivativeCheck would be allowed to be on while there is no GradObj?
I would say that no warning is strictly necessary because one of two cases are possible: (1) DerivativeCheck='on' was intention...

4일 전 | 0

답변 있음
How to create a Aij matrix with the commands 'for', 'function output=name_of_code' and 'imagesc'?
m=100; n=150; A=((1:m)'-(1:n)).^2; for i=1:min(m,n) A(i,i)=2*i.^2; end imagesc(A)

5일 전 | 0

| 수락됨

답변 있음
How to create a Aij matrix with the commands 'for', 'function output=name_of_code' and 'imagesc'?
I don't know how to do it and I didn't find any example. Not even here? https://www.mathworks.com/help/matlab/ref/for.html#bu...

5일 전 | 0

답변 있음
Fill in values in function
Z = @(X,Y) (1.5-X+X.*Y).^2 +(2.25-X+X.*(Y.^2)).^2+(2.625-X+X.*(Y).^3).^2; Z(0,0)

5일 전 | 1

| 수락됨

답변 있음
Parallelize nested loops with parfor
Never mind my other answer. I didn't notice that a_sim and h_sim were recursively defined. You can't avoid a loop, but you only ...

5일 전 | 0

답변 있음
Parallelize nested loops with parfor
I don't think it makes sense to use any loops here at all. Just make vectorized calls to your griddedInterpolant objects. [~,~,...

5일 전 | 0

답변 있음
How to interpret actual Camera Intrinsics/Principal Points results?
The uncertainty values look kind of large to me. I wonder if your 22 images are diverse enough.

5일 전 | 0

답변 있음
Extracting two columns from 6-D complex double
T=table((1:numel(val))' , abs(val(:)).^2 )

6일 전 | 0

| 수락됨

답변 있음
Effect of zero padding on FFT amplitude
When zero-padding such a signal one fundamentally change the signal from a constant-valued signal to a square-wave @Bjorn Gus...

6일 전 | 0

답변 있음
How to find the closest values (positive and negative) to the line when X is zero?
load Data %Create line plot [x,is] = sort(V); y = J(is); in=find(x<0,1,'last'); ip=find(x>0,1,'first'); [xn,yn, ...

6일 전 | 0

| 수락됨

답변 있음
Objective function for fmincon from surrogate model
Can't you just do, fun=@(X) norm(mdl.predict(X)-y).^2

6일 전 | 0

| 수락됨

답변 있음
Is it possible to add more constraints than the default ones in LSQLIN function?
You can still use lsqlin, but as John said, you can add additional inequality constraints as follows, Q=-sign(d).*C; r=zeros(s...

7일 전 | 1

| 수락됨

답변 있음
Optimising Limits of Chain integrals
There is virtually no benefit to the problem based approach if you are going to use fminunc. The main advantage of problem-base...

7일 전 | 0

답변 있음
Cross-correlation of two complex signals using sliding dot product
If there is to be no zero-padding, what should happen when the shorter signal slides to the edge of the longer signal? Does the ...

7일 전 | 0

| 수락됨