mutationuniform — Replace selected coordinates or flip selected bits.
Replace selected coordinates or flip selected bits.
Syntax
children=mutationFcn(parents,options,nvars,problem,state,scores,population)
children=mutationFcn(parents,options,nvars,problem,state,scores,population,parameters...)Inputs
parents- Type
Any- Required
- Yes
- Default
- —
- Description
- One-based actual population row indices, one per requested child.
options- Type
Any- Required
- Yes
- Default
- —
- Description
- Scalar genetic options or []; only population representation/range, active schedule and feasibility controls are consumed.
nvars- Type
Any- Required
- Yes
- Default
- —
- Description
- Positive exact genome length.
problem- Type
Any- Required
- Yes
- Default
- —
- Description
- Scalar R2026a operator context with FitnessFcn and active domain inputs; no fitness callback is executed.
state- Type
Any- Required
- Yes
- Default
- —
- Description
- Scalar generation state; Gaussian reads Generation, feasible kernels read Best history.
scores- Type
Any- Required
- Yes
- Default
- —
- Description
- Inactive for these predefined mutation kernels.
population- Type
Any- Required
- Yes
- Default
- —
- Description
- Full real member-by-nvars population.
parents- Type
Any- Required
- Yes
- Default
- —
- Description
- One-based member indices.
options- Type
Any- Required
- Yes
- Default
- —
- Description
- Active genetic mutation controls.
problem- Type
Any- Required
- Yes
- Default
- —
- Description
- Original operator problem context.
state- Type
Any- Required
- Yes
- Default
- —
- Description
- Mutation schedule state.
scores- Type
Any- Required
- Yes
- Default
- —
- Description
- Inactive score context.
population- Type
Any- Required
- Yes
- Default
- —
- Description
- Real member-by-variable matrix.
parameters- Type
Any- Required
- Variadic
- Default
- —
- Description
- Gaussian accepts scale and optional shrink; uniform accepts rate. Other mutation kinds accept no parameters.
Returns
children- Type
Any- Description
- Host double child matrix in the requested parent order.
Errors
RunMat:ga:InvalidArgument- When
- A public argument, active option, operator result or callback state violates its representation, geometry or numerical contract.
- Message
ga: invalid argument
Calling forms
children=mutationFcn(parents,options,nvars,problem,state,scores,population) returns one host-double row per selected one-based parent index. population has nvars columns, options is a scalar genetic options context or [], and problem is the R2026a scalar operator context including FitnessFcn. No fitness or nonlinear constraint function is called. scores is inactive for these predefined kernels. State must be a scalar structure.
Gaussian mutation accepts optional scale and shrink arguments, default one and one. Uniform mutation accepts optional rate, default0.01. Other mutation kinds accept no extra arguments. Scale is finite nonnegative, shrink finite, and rate is in [0,1]. PopulationType is doubleVector, except uniform also supports bitstring with exact zero/one parents. Custom populations use custom mutation callbacks instead.
Schedules and proposals
Gaussian mutation uses InitialPopulationRange and the selected bounds to initialize deviation. It reads nonnegative state.Generation and MaxGenerations, then reconstructs the recursive shrink schedule through the next generation. Each coordinate receives a normal displacement. An unrepresentable proposal retains its parent; a deviation that cannot be represented is an error. Uniform mutation independently replaces selected coordinates with uniform draws in their working intervals, or flips selected bits for bitstring populations.
Power mutation uses displacement fraction U^2 toward a selected interval endpoint. Adaptive-feasible and positive-basis mutations use the original linear/bound/integer geometry and the same exact feasible-cone owner as ga. They require an originally feasible parent. Their standalone adaptation reconstructs successful and unsuccessful transitions from consecutive state.Best values; finite lower values are improvements. Adaptive-feasible samples maximal-cone directions; positive-basis cycles the minimal basis. A blocked direction retains its parent.
Working intervals use InitialPopulationRange and finite bounds; absent ranges use [-10,10] for continuous variables and [-9999,10001] for mixed-integer problems, shifted/intersected with the admitted domain. Only power and feasible mutations consume original linear/integer rows; Gaussian and uniform do not enforce those rows. The outer ga solver independently admits its offspring. A standalone power proposal does not round coordinates to integers.
Services and representation
Only active data and controls pass class and authenticated residency admission. The declared GA extensions admit exact native numeric data, promote single data, and independently gate exact integer controls. Authenticated automatic placement can materialize on the host; explicit or unproven device intent requires caller gather. Inactive scores, nonlinear callbacks and unrelated option payloads are not traversed.
These standalone mutations capture their selected Clock service, use the original runtime random stream and cancellation checkpoints, and refuse finite host-memory policies before workspace construction. They do not reset the enclosing solver's clock or count their numerical work as fitness evaluation. Errors after random draws do not replay the operation. Their public state-based schedule does not retain a hidden global cache.
Example
Use the predefined genetic operator
p=struct('FitnessFcn',@(x)x(1)^2); C=mutationuniform([1 2],[],2,p,struct(),[],[1 2;3 4],0);Using mutationuniform with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how mutationuniform changes the result.
Run a small mutationuniform example, explain the result, then change one input and compare the output.
Related Math functions
Optim
acceptancesa · annealingboltz · annealingfast · coneprog · crossoverarithmetic · crossoverheuristic · crossoverintermediate · crossoverlaplace · crossoverscattered · crossoversinglepoint · crossovertwopoint · eqnproblem · EquationProblem.solve · EquationProblem.subsasgn · EquationProblem.subsref · evaluate · fgoalattain · fitscalingprop · fitscalingrank · fitscalingshiftlinear · fitscalingtop · fminbnd · fmincon · fminimax · fminsearch · fminunc · fseminf · fsolve · fzero · ga · gacreationlinearfeasible · gacreationnonlinearfeasible · gacreationsobol · gacreationuniform · gacreationuniformint · gaplotbestf · gaplotbestindiv · gaplotdistance · gaplotexpectation · gaplotgenealogy · gaplotmaxconstr · gaplotrange · gaplotscorediversity · gaplotscores · gaplotselection · gaplotstopping · integerConstraint · integral · intlinprog · linprog · lsqcurvefit · lsqlin · LsqlinWarmStart.subsasgn · LsqlinWarmStart.subsref · lsqnonlin · lsqnonneg · mutationadaptfeasible · mutationgaussian · mutationpositivebasis · mutationpower · optimexpr · optimget · OptimizationConstraint.evaluate · OptimizationConstraint.subsasgn · OptimizationConstraint.subsref · OptimizationExitflag.double · OptimizationExitflag.eq · OptimizationExitflag.ne · OptimizationExitflag.string · OptimizationExpression.acos · OptimizationExpression.acosh · OptimizationExpression.acot · OptimizationExpression.acoth · OptimizationExpression.acsc · OptimizationExpression.acsch · OptimizationExpression.asec · OptimizationExpression.asech · OptimizationExpression.asin · OptimizationExpression.asinh · OptimizationExpression.atan · OptimizationExpression.atanh · OptimizationExpression.cat · OptimizationExpression.cos · OptimizationExpression.cosh · OptimizationExpression.cot · OptimizationExpression.coth · OptimizationExpression.csc · OptimizationExpression.csch · OptimizationExpression.ctranspose · OptimizationExpression.cumprod · OptimizationExpression.cumsum · OptimizationExpression.diag · OptimizationExpression.diff · OptimizationExpression.dot · OptimizationExpression.eq · OptimizationExpression.evaluate · OptimizationExpression.exp · OptimizationExpression.ge · OptimizationExpression.horzcat · OptimizationExpression.ldivide · OptimizationExpression.le · OptimizationExpression.log · OptimizationExpression.mean · OptimizationExpression.minus · OptimizationExpression.mldivide · OptimizationExpression.mpower · OptimizationExpression.mrdivide · OptimizationExpression.mtimes · OptimizationExpression.norm · OptimizationExpression.plus · OptimizationExpression.power · OptimizationExpression.prod · OptimizationExpression.rdivide · OptimizationExpression.reshape · OptimizationExpression.sec · OptimizationExpression.sech · OptimizationExpression.sin · OptimizationExpression.sinh · OptimizationExpression.sqrt · OptimizationExpression.subsasgn · OptimizationExpression.subsref · OptimizationExpression.sum · OptimizationExpression.tan · OptimizationExpression.tanh · OptimizationExpression.times · OptimizationExpression.trace · OptimizationExpression.transpose · OptimizationExpression.uminus · OptimizationExpression.uplus · OptimizationExpression.vertcat · OptimizationExpression.zeros · OptimizationExpression.zerosLike · OptimizationProblem.solve · OptimizationProblem.subsasgn · OptimizationProblem.subsref · OptimizationVariable.subsasgn · OptimizationVariable.subsref · optimoptions · optimplotconstrviolation · optimplotfirstorderopt · optimplotfunccount · optimplotfval · optimplotfvalconstr · optimplotmilp · optimplotstepsize · optimplotx · optimproblem · optimset · optimvar · optimwarmstart · particleswarm · patternsearch · psplotbestf · psplotbestx · psplotfuncount · psplotmaxconstr · psplotmeshsize · pswcreationuniform · pswplotbestf · quad · quadprog · QuadprogWarmStart.subsasgn · QuadprogWarmStart.subsref · saplotbestf · saplotbestx · saplotf · saplotstopping · saplottemperature · saplotx · savemilpsolutions · secondordercone · selectionremainder · selectionroulette · selectionstochunif · selectiontournament · selectionuniform · simulannealbnd · solve · surrogateopt · surrogateoptplot · temperatureboltz · temperatureexp · temperaturefast
Elementwise
abs · angle · besselj · bsxfun · complex · conj · double · eps · erf · erfcinv · exp · expm1 · flintmax · gamma · gammaln · heaviside · hypot · imag · int16 · int32 · int64 · int8 · intmax · intmin · ldivide · log · log10 · log1p · log2 · minus · nextpow2 · plus · pow2 · power · rdivide · real · realmax · realmin · realsqrt · rescale · sign · single · sqrt · times · typecast · uint16 · uint32 · uint64 · uint8
Trigonometry
acos · acosd · acosh · acotd · acscd · asecd · asin · asind · asinh · atan · atan2 · atan2d · atand · atanh · cos · cosd · cosh · cospi · deg2rad · pol2cart · rad2deg · sin · sind · sinh · sinpi · tan · tand · tanh
Reduction
all · any · bounds · cummax · cummin · cumprod · cumsum · cumtrapz · diff · gradient · max · maxk · mean · median · min · mink · movmax · movmean · movmedian · movmin · movprod · movstd · movsum · movvar · nnz · prod · rms · std · sum · trapz · var
Structure
bandwidth · isdiag · ishermitian · issymmetric · istril · istriu · symrcm
Signal
blackman · butter · buttord · cheb2ord · conv · conv2 · deconv · downsample · envelope · filter · filtfilt · fir1 · freqz · gauspuls · hamming · hann · hilbert · periodogram · pulstran · pwelch · rectpuls · resample · sawtooth · sinc · spectrogram · square · tripuls · unwrap · upsample · zplane
Factor
chol · decomposition · decomposition.ctranspose · decomposition.mldivide · decomposition.mrdivide · decomposition.mtimes · decomposition.rdivide · decomposition.subsref · decomposition.times · decomposition.uminus · decomposition.uplus · eig · eigs · gmres · ichol · ilu · lu · ordeig · ordqz · ordschur · pcg · qr · qz · rsf2csf · schur · svd
Ops
cross · ctranspose · dot · mldivide · mpower · mrdivide · mtimes · pagemtimes · pagetranspose · trace · transpose
Interpolation
griddedInterpolant · griddedInterpolant.subsref · interp1 · interp1q · interp2 · pchip · ppval · spline
Integer Division
Source you can read
Every RunMat function's source is public. Read exactly how mutationuniform is executed, line by line, in Rust.
- View the source for mutationuniform in Rust on GitHub
- Learn how the RunMat runtime works
- Found a bug? Open an issue with a minimal reproduction.
About RunMat
RunMat is a runtime that executes MATLAB-syntax code fast on any GPU. The runtime is free for individuals, including freelancers; students and faculty at an academic institution, for teaching or research there; contributors to an open-source project, for work on that project; organizations with 250 or fewer people and US$10M or less in annual revenue; and anyone, for non-production use. See runmat.com/license.
- RunMat automatically optimizes your math for GPU execution on Apple, Nvidia, and AMD hardware. No code changes needed. Simulations that took hours now take minutes.
- Start running code in seconds. RunMat runs in the browser, on the desktop, or from the CLI. No license server, no IT ticket.